论文信息 - A proof of Marton's coding theorem for the discrete memoryless broadcast channel - 字舞流文

A proof of Marton's coding theorem for the discrete memoryless broadcast channel

A simple proof using random partitions and typicality is given for Marton's coding theorem for broadcast channels.

Edward C. van der Meulen | Abbas El Gamal | A. Gamal | E. Meulen

[1] Thomas M. Cover,et al. An achievable rate region for the broadcast channel , 1975, IEEE Trans. Inf. Theory.

[2] Patrick P. Bergmans,et al. Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.

[3] Edward C. van der Meulen,et al. A survey of multi-way channels in information theory: 1961-1976 , 1977, IEEE Trans. Inf. Theory.

[4] Edward C. van der Meulen,et al. Random coding theorems for the general discrete memoryless broadcast channel , 1975, IEEE Trans. Inf. Theory.

[5] Katalin Marton,et al. A coding theorem for the discrete memoryless broadcast channel , 1979, IEEE Trans. Inf. Theory.

[6] Daniel J. Costello,et al. Binary convolutional codes for a multiple-access channel (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[7] Thomas M. Cover,et al. A Proof of the Data Compression Theorem of Slepian and Wolf for Ergodic Sources , 1971 .

[8] Abbas El Gamal,et al. Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.