Codes Produced by Permutations: The Link Between Source and Channel Coding

Abstract

The main result of Ahlswede and Dueck (IEEE Trans. Inf. Theory, IT–28(3):430–443, 1982, [5]) is that good codes, even those meeting the random coding bound, can be produced with relatively few (linear in the block length) permutations from a single codeword. This cutdown in complexity may be of practical importance. The motivation for looking at such codes came from our covering lemma, which makes it possible to build correlated source codes from channel codes via permutations.