Bit-stuffing bounds on the capacity of 2-dimensional constrained arrays

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1998, Pages 323-

  Siegel, P H ^a   Wolf, J K ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIT STUFFINGS; LOWER BOUNDS; RUN LENGTH; VERTICAL DIMENSIONS;

INFORMATION THEORY;

EID: 84890333565     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1998.708928     Document Type: Conference Paper

References (3)

1. P. Bender and J-K. Wolf, "A universal algorithm for generating optimal and nearly optimal run-length-limited, charge constrained binary sequences," Proc. 1993 IEEE Int. Symp. Inform. Theory, San Antonio, TX, Jan. 17-22, 1993, p. 6.
2. N.J. Calkin and H.S. Wilf, "The number of independent sets in a grid graph," SIAM J. Discr. Math., to appear.
3. A. Kato and K. Zeger, "On the capacity of two-dimensional run-length-limited codes," Proc. 1998 IEEE Int. Symp. Inform. Theory, Cambridge, MA, Aug. 16-21, 1998.