New Capacity-Approaching Codes for Run-Length-Limited Channels

To my parents ACKNOWLEDGEMENTS I have cherished the opportunity to work with Dr. Steven W. McLaughlin. His constant encouragement and enthusiasm have made us all feel comfortable. I am very grateful for his guidance, and wish him and his family the very best in coming years. V. Kuznetsov for several helpful discussions and insights. Other not-so-insightful, but nevertheless entertaining discussions kept the flame burning through these long years. They are attributed to colleagues and labmates, past and present. My survival has also depended on several friends, who have been a source of inspiration in their own ways. My fond recollections also, of a year spent at Georgia Tech Lorraine-thanks again to Steve-where I did everything else but learn French. Many thanks to the ever-friendly Josyane Roschitz. Half the world away, my parents have been my biggest strength. During all these years far from home, they have still managed to convey their love and affection every single day. That I have come this far is testament to their resolve and dedication.

[1]  Steven W. McLaughlin.  The construction of M-ary (d, {infty}) codes that achieve capacity and have the fewest number of encoder states , 1997, IEEE Trans. Inf. Theory.

[2]  Kees A. Schouhamer Immink.  A practical method for approaching the channel capacity of constrained channels , 1997, IEEE Trans. Inf. Theory.

[3]  P. Siegel,et al.  Bounds on the rate of codes which forbid specified difference sequences , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[4]  Jaekyun Moon,et al.  Timing Recovery in Conjunction With Maximum Likelihood Sequence Detection in the Presence of Intersymbol Interference , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[5]  Paul H. Siegel,et al.  An improvement to the bit stuffing algorithm , 2005, IEEE Transactions on Information Theory.

[6]  A. Robert Calderbank,et al.  A Modified Concatenated Coding Scheme, with Applications to Magnetic Data Storage , 1998, IEEE Trans. Inf. Theory.

[7]  Steven W. McLaughlin,et al.  Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing , 2007, IEEE Transactions on Information Theory.

[8]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[9]  Paul H. Siegel,et al.  Equalities among Capacities of (d, k)-Constrained Systems , 2004, SIAM J. Discret. Math..

[10]  Glen G. Langdon,et al.  Arithmetic Coding , 1979 .

[11]  Jian Luo,et al.  On the capacity of M-ary runlength-limited codes , 1995, IEEE Trans. Inf. Theory.

[12]  D. Bloomberg,et al.  Channel capacity of charge-constrained run-length limited codes , 1981 .

[13]  Kees A. Schouhamer Immink,et al.  Encoding of dklr-sequences using one weight set , 1996, IEEE Trans. Inf. Theory.

[14]  Frederick Jelinek,et al.  On variable-length-to-block coding , 1972, IEEE Trans. Inf. Theory.

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

[16]  Paul H. Siegel,et al.  A note on the Shannon capacity of run-length-limited codes , 1987, IEEE Trans. Inf. Theory.

[17]  Glen G. Langdon,et al.  Arithmetic Codes for Constrained Channels , 1983, IBM J. Res. Dev..

[18]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[19]  Paul H. Siegel,et al.  Sliding-block decodable encoders between (d,k) runlength-limited constraints of equal capacity , 2004, IEEE Transactions on Information Theory.

[20]  Steven W. McLaughlin,et al.  A fixed-rate bit stuffing approach for high efficiency k-constrained codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[21]  Kenneth J. Kerpez.  Runlength codes from source codes , 1991, IEEE Trans. Inf. Theory.

[22]  Jaekyun Moon,et al.  Maximum transition run codes for data storage systems , 1996 .

[23]  Thomas M. Cover,et al.  Enumerative source encoding , 1973, IEEE Trans. Inf. Theory.

[24]  Paul H. Siegel,et al.  Codes for Digital Recorders , 1998, IEEE Trans. Inf. Theory.

[25]  Paul H. Siegel,et al.  Optimal Parsing Trees for Run-Length Coding of Biased Data , 2006, IEEE Transactions on Information Theory.

[26]  Roy D. Cideciyan,et al.  A PRML System for Digital Magnetic Recording , 1992, IEEE J. Sel. Areas Commun..

[27]  Erdal Arikan.  An implementation of Elias coding for input-restricted channels , 1990, IEEE Trans. Inf. Theory.

[28]  John C. Lawrence.  A new universal coding scheme for the binary memoryless source , 1977, IEEE Trans. Inf. Theory.

[29]  J. Wolf,et al.  A Universal Algorithm for Generating Optimal and Nearly Optimal Run-length-limited, Charge-constrained Binary Sequences , 1993, Proceedings. IEEE International Symposium on Information Theory.

[30]  K. A. Schouhamer Immink,et al.  Combinatorial construction of high rate runlength-limited codes , 1996 .

[31]  John G. Proakis,et al.  Digital Communications , 1983 .

[32]  Steven W. McLaughlin,et al.  Bit Stuff Encoding for (0, G/I) Constraints , 2006, 2006 IEEE International Symposium on Information Theory.

[33]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[34]  Brian H. Marcus,et al.  Finite-State Modulation Codes for Data Storage , 2004 .

[35]  Stephen Todd,et al.  A General Fixed Rate Arithmetic Coding Method for Constrained Channels , 1983, IBM J. Res. Dev..

[36]  S.W. McLaughlin.  Improved Distance M-ary (d,k) Codes for High Density Recording , 1994, Digest of the Magnetic Recording Conference.

[37]  H. Thapar,et al.  A class of partial response systems for increasing storage density in magnetic recording , 1987 .

[38]  Behrouz Farhang-Boroujeny,et al.  Design techniques for weakly constrained codes , 2003, IEEE Trans. Commun..

[39]  Schouhamer Immink,et al.  Codes for mass data storage systems , 2004 .

[40]  Steven W. McLaughlin,et al.  Capacity achieving code constructions for two classes of (d,k) constraints , 2004, IEEE Transactions on Information Theory.

[41]  Mamoru Hoshi,et al.  A reversible distribution converter with finite precision arithmetic , 2002, Proceedings IEEE International Symposium on Information Theory,.

[42]  Steven W. McLaughlin,et al.  Optimal block codes for M-ary runlength-constrained channels , 2001, IEEE Trans. Inf. Theory.

[43]  Jack K. Wolf,et al.  On runlength codes , 1988, IEEE Trans. Inf. Theory.

[44]  J. Pieter M. Schalkwijk,et al.  An algorithm for source coding , 1972, IEEE Trans. Inf. Theory.

[45]  Bane Vasic,et al.  Coding and Signal Processing for Magnetic Recording Systems , 2004 .

[46]  P. Funk,et al.  Run-length-limited codes with multiple spacing , 1982 .

[47]  Steven W. McLaughlin,et al.  Five runlength-limited codes for M-ary recording channels , 1997 .

[48]  B. Brickner,et al.  Design Of a Rate 5/6 Maximum Transition Run Code , 1997, 1997 IEEE International Magnetics Conference (INTERMAG'97).

[49]  A. Wijngaarden,et al.  SIMPLE HIGH-RATE CONSTRAINED CODES , 1996 .

[50]  Steven W. McLaughlin,et al.  A convolution interpretation of (M,d,k) run-length-limited capacity , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[51]  Evangelos Eleftheriou,et al.  On codes satisfying M th-order running digital sum constraints , 1991, IEEE Trans. Inf. Theory.

[52]  Cliff B. Jones.  An efficient coding system for long source sequences , 1981, IEEE Trans. Inf. Theory.