Capacity achieving code constructions for two classes of (d,k) constraints

This correspondence presents two variable-rate encoding algorithms that achieve capacity for the (d,k) constraint when k=2d+1, or when k-d+1 is not prime. The first algorithm, symbol sliding, is a generalized version of the bit flipping algorithm introduced by Aviran In addition to achieving capacity for (d,2d+1) constraints, it comes close to capacity in other cases. The second algorithm is based on interleaving and is a generalized version of the bit stuffing algorithm introduced by Bender and Wolf. This method uses fewer than k-d biased bit streams to achieve capacity for (d,k) constraints with k-d+1 not prime. In particular, the encoder for (d,d+2/sup m/-1) constraints 2 /spl les/ m < /spl infin/ requires only m biased bit streams.

[1]  Gérard D. Cohen,et al.  Bounds on distance distributions in codes of known size , 2004, IEEE Transactions on Information Theory.

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

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

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

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

[6]  Robert J. McEliece,et al.  New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities , 1977, IEEE Trans. Inf. Theory.

[7]  Henning Stichtenoth,et al.  Constructing linear unequal error protection codes from algebraic curves , 2003, IEEE Trans. Inf. Theory.

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

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

[10]  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.

[11]  W. Beckner Inequalities in Fourier analysis , 1975 .

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

[13]  Eva K. Englund,et al.  Constructive codes with unequal error protection , 1997, IEEE Trans. Inf. Theory.

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

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