Good Codes Can Be Produced by a Few Permutations

IEEE Transactions on Information Theory

Volumn 28, Issue 3, 1982, Pages 430-443

  Ahlswede, Rudolf ^a   Dueck, Gunter ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0020128429     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1982.1056514     Document Type: Article

References (26)

1. C. E. SHANNON, “A MATHEMATICAL THEORY OF COMMUNICATION,” Bell Syst. Tech. J., vol. 27, pp. 379-423, 632-656, 1948.
2. R. G. GALLAGER, “A SIMPLE DERIVATION OF THE CODING THEOREM AND SOME APPLICATIONS,” IEEE Trans. Inform. Theory, vol. IT-11, pp. 3-18, 1965.
3. R. AHLSWEDE, “ELIMINATION OF CORRELATION IN RANDOM CODES FOR ARBITRARILY VARYING CHANNELS,” Z. Wahrscheinlichkeitstheorie verwandte Gebiete, vol. 44, pp. 159-175, 1978.
4. R. AHLSWEDE, “A METHOD OF CODING AND ITS APPLICATION TO ARBITRARILY VARYING CHANNELS,” J. Comb., Inform, and Syst. Sci., vol. 5, no. 1, pp. 10-35, 1980.
5. R. AHLSWEDE, “COLORING HYPERGRAPHS: A NEW APPROACH TO MULTI-USER SOURCE CODING,” PART I, J. of Comb., Inform., and System Sciences, vol. 1, pp. 76-115, 1979, PART II, vol. 5, no. 3, pp. 220-268, 1980.
6. D. SLEPIAN and J. K. WOLF, “NOISELESS CODING OF CORRELATED INFORMATION SOURCES,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 471-480, 1973.
7. R. G. GALLAGER, “SOURCE CODING WITH SIDE INFORMATION AND UNIVERSAL CODING,” PRESENTED AT THE IEEE Intern. Symp. Inform. Theory, RONNEBY, SWEDEN, 1976, PREPRINT.
8. V. N. Košelev, “On a problem of separate coding of two dependent sources,” Probl. Peredach. Inform., VPL. 13, pp. 26-32, 1977.
9. I. CSISZAR and J. KORNER, “GRAPH DECOMPOSITION: A NEW KEY TO CODING THEOREMS,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 5-12, Jan. 1981.
10. C. E. SHANNON, R. G. GALLAGER, and E. R. BERLEKAMP, “LOWER BOUNDS TO ERROR PROBABILITY FOR CODING ON DISCRETE MEMORYLESS CHANNELS I—II,” Inform. Contr., vol. 10, pp. 65-103 AND pp. 522-552, 1967.
11. R. M. FANO, Transmission of Information, a Statistical Theory of Communication. NEW YORK: WILEY, 1961.
12. J. WOLFOWITZ, “THE CODING OF MESSAGES SUBJECT TO CHANCE ERRORS,” Illinois J. Math., vol. 1, pp. 591-606, 1957.
13. S. ARIMOTO, “ ON THE CONVERSE TO THE CODING THEOREM FOR THE DISCRETE MEMORYLESS CHANNELS,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 357-359, MAY 1973.
14. G. DUECK and J. KORNER, “RELIABILITY FUNCTION OF A DISCRETE MEMORYLESS CHANNEL AT RATES ABOVE CAPACITY,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 82-85, Jan. 1979.
15. I. Csiszár, J. Körner, and K. MARTON, “A NEW LOOK AT THE ERROR EXPONENT OF A DISCRETE MEMORYLESS CHANNEL,” PRESENTED AT THE IEEE Intern. Symp. Inform. Theory, ITHACA, NY, 1977, PREPRINT.
16. A. HAROUTUNIAN, “ESTIMATES OF THE ERROR EXPONENT FOR THE SEMI-CONTINUOUS MEMORYLESS CHANNEL (IN RUSSIAN),” Probl. Peredach. Inform., vol. 4, pp. 37-48, 1968.
17. R. E. BLAHUT, “HYPOTHESIS TESTING AND INFORMATION THEORY,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 405-417, 1974.
18. V. D. GOPPA, “NONPROBABILISTIC MUTUAL INFORMATION WITHOUT MEMORY,” Prob. Contr. Inform. Theory, vol. 4, pp. 97-102, 1975.
19. R. G. GALLAGER, Information Theory and Reliable Communication. NEW YORK: WILEY, 1968.
20. A. FEINSTEIN, “A NEW BASIC THEOREM OF INFORMATION THEORY,” IRE Trans. Inform. Theory, vol. 4, pp. 2-22, 1954.
21. R. E. BLAHUT, “COMPOSITION BOUNDS FOR CHANNEL BLOCK CODES,” IEEE Trans. Inform. Theory, IT-23, pp. 656-674, 1977.
22. C. E. SHANNON, “CERTAIN RESULTS IN CODING THEORY FOR NOISY CHANNELS,” Inform. Contr., vol. 1, pp. 6-25, 1957.
23. R. AHLSWEDE, “CHANNEL CAPACITIES FOR LIST CODES,” J. Appl. Prob., vol. 10, pp. 824-836, 1973.
24. I. CSISZAR and J. KORNER, Information Theory: Coding Theorems for Discrete Memoryless Systems. NEW YORK: ACADEMIC, 1981, TO APPEAR.
25. J. K. OMURA, “A LOWER BOUNDING METHOD FOR CHANNEL AND SOURCE CODING PROBABILITIES,” Inform. Contr., vol. 27, pp. 148-177, 1975.
26. R. L. DOBRUSHIN and S. Z. STAMBLER, “ CODING THEOREMS FOR CLASSES OF ARBITRARILY VARYING DISCRETE MEMORYLESS CHANNELS (IN RUSSIAN),” Probl. Peredach. Inform., vol. 11, pp. 3-22, 1975.