Elliot Linzer, M. Vetterli
Computing
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
Elliot Linzer, M. Vetterli
Computing
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014