Title :
Array codes with progressive redundancy
Author :
Roth, Ron M. ; Seroussi, Gadiel
Author_Institution :
Hewlett-Packard Labs., Palo Alto, CA, USA
fDate :
29 Jun-4 Jul 1997
Abstract :
It is observed that although the conventional product code scheme offers very good error protection, it contains excessive redundancy, due to the fact that the “inner” code provides the “outer” code with information on many error patterns that exceed the correction capability of the outer code. A coding scheme is presented where this excess redundancy is eliminated. The savings amount in some cases to a reduction of almost 50% in the number of redundant symbols
Keywords :
coding errors; error correction codes; error statistics; probability; array codes; burst error correction code; code dimension; error patterns; error protection; inner code; maximum distance separable codes; miscorrection probability; outer code; product code; progressive redundancy; redundant symbols; Concatenated codes; Encoding; Error correction codes; Laboratories; Milling machines; Parity check codes; Product codes; Random variables; Redundancy; Reed-Solomon codes;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613218
