The construction of M-ary (d,∞) codes that achieve capacity and have the fewest number of encoder states

Author

McLaughlin, Steven W.

Author_Institution

Dept. of Electr. Eng., Rochester Inst. of Technol., NY, USA

Volume

43

Issue

2

fYear

1997

fDate

3/1/1997 12:00:00 AM

Firstpage

699

Lastpage

703

Abstract

The existence of 100% efficient (i.e., capacity-achieving) fixed-rate codes for input-constrained, noiseless channels is guaranteed provided the channel has rational capacity. A class of M-ary runlength-limited (M,d,∞) constraints was shown in previous work to have rational capacity. In this correspondence we present a code construction procedure for obtaining 100% efficient codes with the fewest number of encoder states for all (M,d,∞) constraints with rational capacity. The decoders are sliding-block decoders with sliding window size d+1

Keywords

binary sequences; block codes; channel capacity; channel coding; constraint theory; decoding; graph theory; runlength codes; M-ary (d,∞) codes; M-ary runlength-limited (M,d,∞) constraints; code construction; encoder states; fixed-rate; input-constrained noiseless channels; rational capacity; sliding window size; sliding-block decoders; Channel capacity; Decoding; H infinity control; Information theory; Magnetic materials; Magnetic recording; Optical materials; Optical recording; Saturation magnetization; Signal to noise ratio;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.556125

Filename

556125