Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
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
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design