Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
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
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
David A. Selby
IBM J. Res. Dev
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University