Exponential Error Bounds for Random Codes in the Arbitrarily Varying Channel

IEEE Transactions on Information Theory

Volumn 31, Issue 1, 1985, Pages 42-48

  Ericson, Thomas ^a  

^a LINKÖPING INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY - COMMUNICATION CHANNELS;

ARBITRARILY VARYING CHANNEL; EXPONENTIAL ERROR BOUNDS; RANDOM CODES;

CODES, SYMBOLIC;

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

References (15)

1. I. Csiszár and J. Körner, Information Theory. New York: Academic, 1981, Ch. 2, § 6, pp. 204–233.
2. D. Blackwell, L. Breiman, and A. J. Thomasian, “The capacities of certain channel classes under random coding,” Ann. Math. Statist., vol. 31, pp. 558–567, 1960.
3. J. Kiefer and J. Wolfowitz, “Channels with arbitrarily varying channel probability functions,” Inform. Contr., vol. 6, pp. 44–54, 1962.
4. I. G. Stiglitz, “Coding for a class of unknown channels,” IEEE Trans. Inform. Theory, vol. IT-12, no. 2, pp. 189–195, 1966.
5. R. Ahlswede and J. Wolfowitz, “The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet,” Z. Wahrscheinlichkeitstheorie u. verw. Gebiete, vol. 15, pp. 186–194, 1970.
6. R. Ahlswede, “Elimination of correlation in random codes for arbitrarily varying channels,” Z. Wahrscheinlichkeitstheorie u. verw. Gebiete, vol. 44, pp. 159–175, 1978.
7. “A method of coding and an application to arbitrarily varying channels,” J. Combinatorics, Inform. Syst. Sc., vol. 5, pp. 10–35, 1980.
8. I. Csiszár and J. Körner, “On the capacity of the arbitrarily varying channel for maximum probability of error,” Z. Wahrscheinlichkeitstheorie lichkeitstheorie U. verw. Gebiete, vol. 57, pp. 87–101, 1981.
9. T. Ericson, “The non-cooperative binary adder channel,” Linköping Inst. of Technology, Internal Rep. LiTH-15171-0540, 1982. (Also in IEEE Trans. Inform. Theory, to be published.)
10. “Binary communication over a channel subject to active interference,” 1982 Int. Prague Conf. Inform. Theory.
11. “A min-max theorem for anti-jamming group codes,” DFVLR, 1983. (Also in IEEE Trans. Inform. Theory, vol. IT-30, no. 6, Nov. 1984.)
12. R. G. Gallager Information Theory and Reliable Communication. New York: Wiley, 1968.
13. R. L. Pickholtz, D. L. Schilling, and L. B. Milstein, “Theory of spread spectrum—a tutorial,” IEEE Trans. Commun., vol. COM-30, no. 5, pp. 855–884, 1982.
14. S. Karlin, Mathematical Methods and Theory in Games, programming and Economics, vol. 2. New York: Pergamon, 1959.
15. D. Blackwell, L. Breiman, and A. J. Thomasian, “The capacity of a class of channels,” Ann. Math. Statist., vol. 30, pp. 1229–1241, 1959.