Upper bound on the capacity of constrained three-dimensional codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2000, Pages 282-

  Forchhammer, S ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

THREE DIMENSIONAL CODES; TRANSFER MATRIX;

CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); CONSTRAINT THEORY; EIGENVALUES AND EIGENFUNCTIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; SET THEORY; THEOREM PROVING; THREE DIMENSIONAL;

CODES (SYMBOLS);

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

References (4)

1. d subshifts of finite type
2. The number of independent sets in a grid graph
3. Capacity bounds for the 3-dimensional (0,1) runlength limited channel
4. An upper bound on the entropy of constrained 2d fields