Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Recently the paradigm of skew-tolerant parallel asynchronous communication was introduced, along with constructions for codes that can tolerate or detect skew. Some of these constructions were improved in [8]. In this paper these constructions are improved upon further, and we prove that the new constructions are, in a certain sense, optimal. © 1993 IEEE
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000