Linear codes for sources and source networks: Error exponents, universal coding
- 1 July 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 28 (4) , 585-592
- https://doi.org/10.1109/tit.1982.1056524
Abstract
For Slepian-Wolf source networks, the error exponents obtained by Körner,Marton, and the author are shown to be universally attainable by linear codes also. Improved exponents are derived for linear codes with "large rates." Specializing the results to simple discrete memoryless sources reveals their relationship to the random coding and expurgated bounds for channels with additive noise. One corollary is that there are universal linear codes for this class of channels which attain the random coding error exponent for each channel in the class. The combinatorial approach of Csiszár-Körner-Marton is used. In particular, all results are derived from a lemma specifying good encoders in terms of purely combinatorial properties.Keywords
This publication has 13 references indexed in Scilit:
- Good codes can be produced by a few permutationsIEEE Transactions on Information Theory, 1982
- The error exponent for the noiseless encoding of finite ergodic Markov sourcesIEEE Transactions on Information Theory, 1981
- On the capacity of the arbitrarily varying channel for maximum probability of errorProbability Theory and Related Fields, 1981
- Graph decomposition: A new key to coding theoremsIEEE Transactions on Information Theory, 1981
- Universally attainable error exponents for broadcast channels with degraded message setsIEEE Transactions on Information Theory, 1980
- Towards a general theory of source networksIEEE Transactions on Information Theory, 1980
- How to encode the modulo-two sum of binary sources (Corresp.)IEEE Transactions on Information Theory, 1979
- The Noisy Channel Coding Theorem for Erasure ChannelsThe American Mathematical Monthly, 1974
- Hypothesis testing and information theoryIEEE Transactions on Information Theory, 1974
- Asymptotic Optimality of Group and Systematic Codes for Some ChannelsTheory of Probability and Its Applications, 1963