ON THE CAPACITY OF M-ARY RUNLENGTH-LIMITED CODES

Authors
MCLAUGHLIN SW LUO JA XIE Q
Citation
Sw. Mclaughlin et al., ON THE CAPACITY OF M-ARY RUNLENGTH-LIMITED CODES, IEEE transactions on information theory, 41(5), 1995, pp. 1508-1511
Citations number
10
Categorie Soggetti
Information Science & Library Science","Engineering, Eletrical & Electronic
Journal title
IEEE transactions on information theory → ACNP
ISSN journal
00189448
Volume
41
Issue
5
Year of publication
1995
Pages
1508 - 1511
Database
ISI
SICI code
0018-9448(1995)41:5<1508:OTCOMR>2.0.ZU;2-U
Abstract
In this correspondence we present two results on the Shannon capacity of M-ary (d, k) codes. First we show that 100% efficient fixed-rate co des are impossible for all values of (M, d, k), O less than or equal t o d < k < infinity, M < infinity, thereby extending a result of Ashley and Siegel to M-ary channels. Second, we show that for k = infinity, there exist an infinite number of 100% efficient M-ary (d, k) codes, a nd we construct three such capacity-achieving codes.