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

  title={Capacity achieving code constructions for two classes of (d,k) constraints},
  author={Yogesh Sankarasubramaniam and Steven W. McLaughlin},
  journal={IEEE Transactions on Information Theory},
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… CONTINUE READING


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 14 references

A universal algorithm for generating optimal and nearly optimal run-length-limited, charge constrained binary sequences

P. Bender, J. K. Wolf
Proc. IEEE ISIT’93, pp. 6-6, January 1993. • 1993
View 7 Excerpts
Highly Influenced

On runlength codes

IEEE Trans. Information Theory • 1988
View 12 Excerpts
Highly Influenced

An improvement to the bit stuffing algorithm

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. • 2004

Runlength codes from source codes

G. G. Langdon, S. J. P. Todd
IEEE Trans . Inform . Theory • 1991

The Enumeration of (d,k) Sequences,

K. Forsberg, I. F. Blake
In Proc. 26th Allerton Conf. on Communications, • 1988

An efficient coding system for long source sequences

IEEE Trans. Information Theory • 1981
View 1 Excerpt

Similar Papers

Loading similar papers…