S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
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. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006