The capacity of some hexagonal (d, k)-constraints

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2001, Pages 64-

  Kukorelly, Z ^a   Zeger, K ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODEWORDS; HEXAGONAL LATTICE; SQUARE LATTICE; ZERO CAPACITY REGION;

ASYMPTOTIC STABILITY; BINARY SEQUENCES; BOUNDARY CONDITIONS; CONSTRAINT THEORY; ENCODING (SYMBOLS); FUNCTIONS; TOPOLOGY;

BINARY CODES;

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

References (5)

1. Hard hexagons: Exact solution
2. The number of independent sets in a grid graph
3. On the capacity of two-dimensional run length constrained channels
4. Efficient coding schemes for the hard-square model
5. The capacity and coding gain of certain checkerboard codes