S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
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
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking