Bruck, Jehoshua and Blaum, Mario (1992) New techniques for constructing EC/AUED codes. IEEE Transactions on Computers, 41 (10). pp. 1318-1324. ISSN 0018-9340 http://resolver.caltech.edu/CaltechAUTHORS:BRUieeetc92b
- Published Version
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:BRUieeetc92b
The most common method to construct a t-error correcting/all unidirectional error detecting (EC/AUED) code is to choose a t-error correcting (EC) code and then to append a tail in such a way that the new code can detect more than t errors when they are unidirectional. The tail is a function of the weight of the codeword. We present two new techniques for constructing t-EC/AUED codes. The first technique modifies the t-EC code in such a way that the weight distribution of the original code is reduced. So, a smaller tail is needed. Frequently, this technique gives less overall redundancy than the best available t-EC/AUED codes.
|Additional Information:||© Copyright 1992 IEEE. Reprinted with permission. Manuscript received May 15, 1989; revised July 10, 1990.|
|Subject Keywords:||Coset; decoding; descending tail matrix; encoding; error-correcting codes; redundancy; unidirectional errors; unidirectional error detecting codes; encoding; error correction codes; error detection codes; fault tolerant computing; EC/AUED codes; all unidirectional error detection; weight distribution|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Kristin Buxton|
|Deposited On:||11 Sep 2008 17:43|
|Last Modified:||26 Dec 2012 10:17|
Repository Staff Only: item control page