T. Cover
Selected Papers on Network Information Theory

  1. Thomas M. Cover. Broadcast Channels. IEEE Transactions on Information Theory, IT-18(1):2--14, January 1972. Reprinted in Record of COMSAT, seminar on Multiple User Communications, UPO43CL, Clarksburg, Maryland, May 1975. Reprinted in Key Papers in the Development of Information Theory. IEEE Press, 1974. ed. by D. Slepian.

    This paper introduces the broadcast channel and finds the capacity for degraded channels. It introduces the techniques of superposition coding and auxiliary random variables.

  2. Thomas M. Cover. A Proof of the Data Compression Theorem of Slepian and Wolf for Ergodic Sources. IEEE Transactions on Information Theory, IT-21(2):226--228, March 1975. Reprinted in Ergodic and Information Theory, L. Davisson, R. Gray (eds), Benchmark Papers in Electrical Engineering and Computer Science, Dowden, Hutchinson, and Ross, Penn. (Part V, pp. 305-307.)

    Introduces random binning. Generalizes Slepian Wolf theorem to a wide family of processes with a simple binning proof.

  3. Thomas M. Cover. Some Advances in Broadcast Channels. Chapter in the book Advances in Communication Theory, Academic Press, San Francisco, 1975. ed. by A. Viterbi. (Volume 4 of Theory and Applications).

    Establishes the capacity of the Gaussian multiple access channel. Gives optimal region for CDMA. Introduces successive interference cancellation (onion peeling).

  4. Thomas M. Cover and Abbas A. El Gamal. Capacity Theorems for the Relay Channel. IEEE Transactions on Information Theory, IT-25(5):572--584, September 1979.

    Introduces relay channels and block Markov encoding to establish channel capacity for a class of relay channels.

  5. Abbas A. El Gamal and Thomas M. Cover. Achievable Rates for Multiple Descriptions. IEEE Transactions on Information Theory, IT-28(6):851--857, November 1982.

    Theory of how to give multiple descriptions so any subset of them is a good description. Applications to packet radio communication.