By Topic

On the capacity of M-ary runlength-limited codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
McLaughlin, S.W. ; Dept. of Electr. Eng., Rochester Inst. of Technol., NY, USA ; Jian Luo ; Qun Xie

Presents two results on the Shannon capacity of M-ary (d,k) codes. First the authors show that 100% efficient fixed-rate codes are impossible for all values of (M,d,k), 0⩽d<k<∞, M<∞, thereby extending a result of Ashley and Siegel (1987) to M-ary channels. Second, they show that for k=∞, there exist an infinite number of 100% efficient M-ary (d,k) codes, and they construct three such capacity-achieving codes

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 5 )