Zohar Feldman, Avishai Mandelbaum
WSC 2010
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
Zohar Feldman, Avishai Mandelbaum
WSC 2010
M.F. Cowlishaw
IBM Systems Journal
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007