Blaum, Mario and Bruck, Jehoshua (1998) Coding for skew correcting and detecting in parallel asynchronous communications. In: 1998 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ , p. 75. ISBN 0-7803-5000-6 http://resolver.caltech.edu/CaltechAUTHORS:20120112-112036174
Full text is not posted in this repository. Consult Related URLs below.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20120112-112036174
We study the problem of pipelined transmission in parallel asynchronous communications allowing a certain amount of skew. We redefine the concept of skew in a way that extends previously known results in this area. Using the new definition of skew, we derive the necessary and sufficient conditions for codes that can tolerate a certain amount of skew and detect a larger amount of skew when the tolerating threshold is exceeded.
|Item Type:||Book Section|
|Additional Information:||© 1998 IEEE. Date of Current Version: 06 August 2002. Supported in part by the NSF Young Investigator Award CCR- 9457811, by an IBM Partnership Award, by the Sloan Research Fellowship and by DARPA through an agreement with NASA/OSAT|
|Other Numbering System:|
|Official Citation:||Blaum, M.; Bruck, J.; , "Coding for skew correcting and detecting in parallel asynchronous communications," Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on , vol., no., pp.75, 16-21 Aug 1998 doi: 10.1109/ISIT.1998.708659 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=708659&isnumber=15310|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Tony Diaz|
|Deposited On:||17 Jan 2012 23:04|
|Last Modified:||23 Aug 2016 10:08|
Repository Staff Only: item control page