Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Error-correcting capabilities of concatenated codes with MDS outer codes on memoryless channels with maximum- likelihood decoding

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)

Error-correcting capabilities of concatenated codes with maximum distance separable (MDS) outer codes and time-varying inner codes, used on memoryless discrete channels with maximum-likelihood decoding, are investigated. It is proved that, asymptotically, the Gallager random coding theorem can be obtained for all rates by such codes. Further, the expurgated coding theorem, as well, is proved to be valid for all rates on regular channels. The latter result implies that the Gilbert-Varshamov bound for block codes over any finite field can be obtained asymptotically for all rates by linear concatenated codes.

Published in:

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