Strong converse theorems for degraded broadcast channels with feedback
暂无分享,去创建一个
[1] Hiroki Koga,et al. Information-Spectrum Methods in Information Theory , 2002 .
[2] Robert G. Gallager,et al. Capacity and coding for degraded broadcast channels , 1974 .
[3] Patrick P. Bergmans,et al. Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.
[4] Michele A. Wigger,et al. On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback , 2010, IEEE Transactions on Information Theory.
[5] Gunter Dueck,et al. Reliability function of a discrete memoryless channel at rates above capacity (Corresp.) , 1979, IEEE Trans. Inf. Theory.
[6] R. AhlswedC,et al. Bounds on Conditional Probabilities with Applications in Multi-User Communication , 1976 .
[7] Imre Csiszár,et al. Feedback does not affect the reliability function of a DMC at rates above capacity , 1982, IEEE Trans. Inf. Theory.
[8] Yasutada Oohama. Strong converse exponent for degraded broadcast channels at rates outside the capacity region , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[9] Rudolf Ahlswede,et al. Source coding with side information and a converse for degraded broadcast channels , 1975, IEEE Trans. Inf. Theory.
[10] A. Sridharan. Broadcast Channels , 2022 .
[11] Abbas El Gamal,et al. The feedback capacity of degraded broadcast channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[12] P. Gács,et al. Bounds on conditional probabilities with applications in multi-user communication , 1976 .
[13] Suguru Arimoto,et al. On the converse to the coding theorem for discrete memoryless channels (Corresp.) , 1973, IEEE Trans. Inf. Theory.