The capacity and coding gain of certain checkerboard codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1998, Pages 322-

  Weeks, W ^a   Blahut, R E ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEST VALUE; CODING GAINS; CODING SCHEME; CONSTRAINED CODES; RECURSIVE CONSTRUCTION;

INFORMATION THEORY;

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

References (5)

1. Jorn Justesen and Yuri Shtarkov, "The Combinatorial Entropy of Images," Preprint.
2. ZhongxingYe and Zhen Zhang, "On the Capacity Rate of Two-Dimensional Runlength-Limited Code," Preprint
3. Carl M. Bender and Steven A. Orszag, Advanced Mathematical Methods For Scientists and Engineers, McGraw-Hill, Inc., St. Louis, 1978.
4. Neil J. Calkin and Herbert S. Wilf, "The Number of Independent Sets in a Grid Graph," http://ejc.math.gatech.edu:8080-/Papers/postscript/ papers.html, To appear in SIAM J Discrete Mathematics.
5. William Weeks IV and Richard E. Blahut, "The Capacity and Coding Gain of Certain Checkerboard Codes," IEEE Trans. Inform. Theory, vol. 44, no. 3, pp. 1193-1203, May 1998