Title :
A class of array codes correcting multiple column erasures
Author :
Keren, Osnat ; Litsyn, Simon
Author_Institution :
Dept. of Electr. Eng.-Syst., Tel Aviv Univ., Israel
fDate :
11/1/1997 12:00:00 AM
Abstract :
A family of binary array codes of size (p-1)×n, with p a prime, correcting multiple column erasures is proposed. The codes coincide with a subclass of shortened Reed-Solomon codes and achieve the maximum possible correcting capability. Complexity of encoding and decoding is proportional to rnp, where r is the number of correctable erasures, i.e., is simpler than the Forney decoding algorithm. The length n of the codes is at most 2p-1, that is, twice as big as the length of the Blaum-Roth codes having comparable decoding complexity
Keywords :
Reed-Solomon codes; computational complexity; decoding; error correction codes; binary array codes; correctable erasures; decoding; decoding complexity; encoding; length; maximum possible correcting capability; multiple column erasures correction; shortened Reed-Solomon codes subclass; size; Encoding; Equations; Error correction; Iterative algorithms; Iterative decoding; Sparse matrices; Strips;
Journal_Title :
Information Theory, IEEE Transactions on
