Graph decomposition: A new key to coding theorems
- 1 January 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 27 (1) , 5-12
- https://doi.org/10.1109/tit.1981.1056281
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Towards a general theory of source networksIEEE Transactions on Information Theory, 1980
- Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)IEEE Transactions on Information Theory, 1979
- Composition bounds for channel block codesIEEE Transactions on Information Theory, 1977
- The zero-error side information problem and chromatic numbers (Corresp.)IEEE Transactions on Information Theory, 1976
- Hypothesis testing and information theoryIEEE Transactions on Information Theory, 1974
- Expurgated bounds, bhattacharyya distance, and rate distortion functionsInformation and Control, 1974
- Noiseless coding of correlated information sourcesIEEE Transactions on Information Theory, 1973
- Hide and Seek, Data Storage, and EntropyThe Annals of Mathematical Statistics, 1971
- A simple derivation of the coding theorem and some applicationsIEEE Transactions on Information Theory, 1965
- The zero error capacity of a noisy channelIEEE Transactions on Information Theory, 1956