论文信息 - A class of array codes correcting multiple column erasures

A class of array codes correcting multiple column erasures

A family of binary array codes of size (p-1)/spl times/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.

Osnat Keren | Simon Litsyn

[1] David L. Cohn,et al. Using Redundancy to Speed up Disk Arrays , 1994 .

[2] Mario Blaum,et al. New array codes for multiple phased burst correction , 1993, IEEE Trans. Inf. Theory.

[3] Arvind Motibhai Patel. Adaptive cross-parity (AXP) code for a high-density magnetic tape subsystem , 1985 .

[4] Chitoor V. Srinivasan. Codes for Error Correction in High-Speed Memory Systems Part II: Correction of Temporary and Catastrophic Errors , 1971, IEEE Transactions on Computers.

[5] R. Blahut. Theory and practice of error control codes , 1983 .

[6] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

[7] M. Blaum,et al. Multiple burst-correcting array codes , 1988, IEEE Trans. Inf. Theory.

[8] Eiji Fujiwara,et al. Error-control coding for computer systems , 1989 .

[9] Se June Hong,et al. A General Class of Maximal Codes ror Computer Applications , 1972, IEEE Transactions on Computers.

[10] P. G. Farrell,et al. Burst-error-correcting array codes , 1982 .

[11] G. David Forney,et al. On decoding BCH codes , 1965, IEEE Trans. Inf. Theory.

[12] S. Litsyn,et al. Codes correcting phased burst erasures , 1996, Proceedings of 19th Convention of Electrical and Electronics Engineers in Israel.