M.F. Cowlishaw
IBM Systems Journal
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
M.F. Cowlishaw
IBM Systems Journal
Hendrik F. Hamann
InterPACK 2013
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002