Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
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
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Fan Zhang, Junwei Cao, et al.
IEEE TETC
Liqun Chen, Matthias Enzmann, et al.
FC 2005