Limin Hu
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
Limin Hu
IEEE/ACM Transactions on Networking
Yigal Hoffner, Simon Field, et al.
EDOC 2004
Daniel M. Bikel, Vittorio Castelli
ACL 2008
Hendrik F. Hamann
InterPACK 2013