Structured iteratively decodable codes based on Steiner systems and their application in magnetic recording

This paper introduces a combinatorial construction of a class of iteratively decodable codes, an approach diametrically opposed to the prevalent practice of using large, random-like codes. Our codes are well-structured and, unlike random codes, can lend themselves to a very low complexity implementation. A systematic way of constructing codes based on Steiner systems and the Z/sub /spl nu//, group is presented, and a hardware efficient encoding algorithm is proposed. A substantial performance improvement of high-rate Steiner codes over the existing schemes used in magnetic recording systems is demonstrated.

[1]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[2]  T. Richardson,et al.  Design of provably good low-density parity check codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[3]  Hans-Andrea Loeliger,et al.  Codes and iterative decoding on general graphs , 1995, Eur. Trans. Telecommun..

[4]  Charles J. Colbourn,et al.  Geometry, Combinatorial Designs and Related Structures: Rosa triple systems , 1997 .

[5]  D. Mackay,et al.  Evaluation of Gallager Codes for Short Block Length and High Rate Applications , 2001 .

[6]  Takushi Nishiya,et al.  Modified EEPRML with 16/17 (3;11) MTR Code and Cyclic Redundancy Check Code for High Density Magnetic Recording Channels , 1999 .

[7]  R. Townsend,et al.  Self-orthogonal quasi-cyclic codes , 1967, IEEE Trans. Inf. Theory.

[8]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[9]  Douglas R. Stinson,et al.  Frames for Kirkman triple systems , 1987, Discret. Math..

[10]  S. Wicker Error Control Systems for Digital Communication and Storage , 1994 .

[11]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[12]  Vijay K. Bhargava,et al.  "(ν, κ, λ) Configurations and Self-Dual Codes" , 1975, Inf. Control..

[13]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[14]  Hanfried Lenz,et al.  Design theory , 1985 .

[15]  Jung-Fu Cheng,et al.  Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..

[16]  David J. C. MacKay,et al.  Good Codes Based on Very Sparse Matrices , 1995, IMACC.

[17]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[18]  Brendan J. Frey,et al.  Graphical Models for Machine Learning and Digital Communication , 1998 .

[19]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[20]  Richard M. Wilson,et al.  Cyclotomy and difference families in elementary abelian groups , 1972 .

[21]  E. Weldon Difference-set cyclic codes , 1966 .

[22]  Brendan J. Frey,et al.  Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models , 1998, IEEE J. Sel. Areas Commun..

[23]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[24]  J. R. Cruz,et al.  Noise predictive turbo systems , 2001 .

[25]  Jaekyun Moon,et al.  A low-density generator matrix interpretation of parallel concatenated single bit parity codes , 2001 .

[26]  William E. Ryan,et al.  Performance of (quasi-)cyclic LDPC codes in noise bursts on the EPR4 channel , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).