By Topic

An iterative code construction for the broadcast channel with degraded message sets (Corresp.)

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)

Ahlswede and Dueck introduced an iterative method for constructing codes for the discrete memoryless channel that meet the random coding bound. Their codes are constructed by making a relatively few permutations of a single codeword. In this correspondence their idea is extended to the broadcast channel with degraded message sets. The codes constructed here have average error probabilities below the error bounds derived by Körner and Sgarro.

Published in:

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