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

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.