|
Volumn 43, Issue 2, 1997, Pages 699-703
|
The construction of M-ary (d, ∞) codes that achieve capacity and have the fewest number of encoder states
a,b |
Author keywords
Constrained codes; Run length limited codes; Shannon capacity
|
Indexed keywords
BINARY SEQUENCES;
CHANNEL CAPACITY;
CONSTRAINT THEORY;
DECODING;
EIGENVALUES AND EIGENFUNCTIONS;
ENCODING (SYMBOLS);
INFORMATION THEORY;
CONSTRAINED CODES;
M-ARY CODES;
NUMBER OF ENCODER STATES;
RUN LENGTH LIMITED CODES;
SHANNON CAPACITY;
SLIDING BLOCK DECODERS;
CODES (SYMBOLS);
|
EID: 0031103734
PISSN: 00189448
EISSN: None
Source Type: Journal
DOI: 10.1109/18.556125 Document Type: Article |
Times cited : (8)
|
References (10)
|