By Topic

Constructive codes for arbitrary discrete memoryless channels

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

1 Author(s)
Steiner, M. ; Naval Res. Lab., Washington, DC, USA

In 1982, Delsarte and Piret constructed a concatenated code for which the error probability decreases exponentially with the block length for a subclass of symmetric channels called regular channels. In the case of arbitrary discrete memoryless channels, they were not able to prove an exponential bound, but one for which the error probability decreases as (log N/N)α where α is related to the random coding exponent and N is the block length. The present author shows that indeed, the codes also satisfy the much stronger exponential bound for arbitrary discrete memoryless channels and hence are good in this sense. It is also indicated that the codes are valid for the bandlimited additive Gaussian noise channel

Published in:

Information Theory, IEEE Transactions on  (Volume:40 ,  Issue: 3 )