Variable- and Fixed-Length Balanced Runlength-Limited Codes Based on a Knuth-Like Balancing Method

A novel Knuth-like balancing method for runlength-limited words is presented, which forms the basis of new variable- and fixed-length balanced runlength-limited codes that improve on the code rate as compared to balanced runlength-limited codes based on Knuth’s original balancing procedure developed by Immink et al. While Knuth’s original balancing procedure, as incorporated by Immink et al., requires the inversion of each bit one at a time, our balancing procedure only inverts the runs as a whole one at a time. The advantage of this approach is that the number of possible inversion points, which needs to be encoded by a redundancy-contributing prefix/suffix, is reduced, thereby allowing a better code rate to be achieved. Furthermore, this balancing method also allows for runlength violating markers which improve, in a number of respects, on the optimal such markers based on Knuth’s original balancing method.

[1]  Jos H. Weber,et al.  Very Efficient Balanced Codes , 2010, IEEE Journal on Selected Areas in Communications.

[2]  Noga Alon,et al.  Balancing sets of vectors , 1988, IEEE Trans. Inf. Theory.

[3]  Akiko Manada,et al.  On the capacities of balanced codes with run-length constraints , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

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

[5]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[6]  Jin-Yong Kim,et al.  Extremely efficient DC-free RLL codes for optical recording , 2001, IEEE Trans. Consumer Electron..

[7]  Jos H. Weber,et al.  Balanced runlength limited codes using Knuth's algorithm , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[8]  Jos H. Weber,et al.  Knuth's Balanced Codes Revisited , 2010, IEEE Transactions on Information Theory.

[9]  Donald E. Knuth,et al.  Efficient balanced codes , 1986, IEEE Trans. Inf. Theory.

[10]  Kees A. Schouhamer Immink,et al.  An enumerative coding technique for DC-free runlength-limited sequences , 2000, IEEE Trans. Commun..

[11]  Bella Bose,et al.  Design of Efficient Balanced Codes , 1994, IEEE Trans. Computers.

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

[13]  Jos H. Weber,et al.  Optimized markers for balancing runlength-limited sequences in optical recording , 2014, 2014 IEEE International Symposium on Information Theory.

[14]  Bella Bose,et al.  On balanced codes , 1990, IEEE Trans. Inf. Theory.

[15]  William E. Ryan,et al.  Coding for Optical Channels , 2010 .

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

[17]  Khaled A. S. Abdel-Ghaffar,et al.  Constructing efficient DC-free runlength-limited block codes for recording channels , 2000, IEEE Trans. Inf. Theory.

[18]  Bodhaswar T. Maharaj,et al.  Using Bivariate Generating Functions to Count the Number of Balanced Runlength-Limited Words , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[19]  Oleg F. Kurmaev,et al.  Constant-Weight and Constant-Charge Binary Run-Length Limited Codes , 2009, IEEE Transactions on Information Theory.

[20]  Jos H. Weber,et al.  Markers to construct DC free (d, k) constrained balanced block codes using Knuth's inversion , 2012 .