Coding for tolerance and detection of skew in parallel asynchronous communications

Creators: Blaum, Mario; Bruck, Jehoshua

Abstract

We provide a new definition for the concept of skew in parallel asynchronous communications introduced by Blaum and Bruck (1993). The new definition extends and strengthens previously known results on skew. We give necessary and sufficient conditions for codes that can tolerate a certain amount of skew under the new definition. We also extend the results to codes that can tolerate a certain amount of skew and detect a larger amount of skew when the tolerating threshold is exceeded

Additional Information

"©2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE." Manuscript received February 20, 1999; revised May 9, 2000. Posted online: 2002-08-06. This work was supported in part by the NSF Young Investigator Award CCR-9457811, by an IBM Partnership award, and by a Sloan Research Fellowship. The material in this paper was presented in part at the IEEE International Symposium on Information Theory (ISIT'98), the Massachusetts Institute of Technology, Cambridge, MA, August 1998. We wish to thank Tom Verhoeff for his numerous comments and suggested improvements.

Files

BLAieeetit00.pdf

Files (210.0 kB)

Name	Size	Download all
BLAieeetit00.pdf md5:668d221a8687a8030629bcf77a38d44b	210.0 kB	Preview Download

Additional details

	All versions	This version
Views	0	0
Downloads	0	0
Data volume	0 Bytes	0 Bytes