Improved bit-stuffing bounds on two-dimensional constraints

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2002, Pages 385-

  Halevy, Shirley ^a   Chen, Jiangxin ^a   Roth, Ron M ^a   Siegel, Paul H ^a   Wolf, Jack K ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BIT-STUFFING ENCODERS;

CONSTRAINT THEORY; MARKOV PROCESSES; SET THEORY; THEOREM PROVING;

ENCODING (SYMBOLS);

EID: 0036350014     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Hard hexagons: Exact solution
2. On the capacity of two-dimensional run length constrained channels
3. The capacity of some hexagonal (d, k)-constraints
4. Efficient coding schemes for the hard-square model
5. Bit-stuffing bounds on the capacity of 2-dimensional constrained arrays
6. The capacity and coding gain of certain checkerboard codes