Superposition Coding Is Almost Always Optimal for the Poisson Broadcast Channel
暂无分享,去创建一个
[1] Bruce E. Hajek,et al. Evaluation of an achievable rate region for the broadcast channel , 1979, IEEE Trans. Inf. Theory.
[2] Aaron D. Wyner,et al. Capacity and error exponent for the direct detection photon channel-Part I , 1988, IEEE Trans. Inf. Theory.
[3] Chandra Nair,et al. On Marton's Inner Bound and Its Optimality for Classes of Product Broadcast Channels , 2014, IEEE Transactions on Information Theory.
[4] Hiroshi Sato,et al. An outer bound to the capacity region of broadcast channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[5] Amos Lapidoth,et al. The Poisson channel with side information , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[6] Chandra Nair,et al. The Capacity Region of the Two-Receiver Gaussian Vector Broadcast Channel With Private and Common Messages , 2014, IEEE Transactions on Information Theory.
[7] Shlomo Shamai,et al. On Broadcast Channels With Binary Inputs and Symmetric Outputs , 2010, IEEE Transactions on Information Theory.
[8] Chandra Nair,et al. An Information Inequality and Evaluation of Marton's Inner Bound for Binary Input Broadcast Channels , 2013, IEEE Transactions on Information Theory.
[9] H. G. Eggleston. Convexity by H. G. Eggleston , 1958 .
[10] Katalin Marton,et al. A coding theorem for the discrete memoryless broadcast channel , 1979, IEEE Trans. Inf. Theory.
[11] Chandra Nair,et al. An Information Inequality and Evaluation of Marton's Inner Bound for Binary Input Broadcast Channels , 2013, IEEE Trans. Inf. Theory.
[12] Israel Bar-David,et al. Information rates of photon-limited overlapping pulse position modulation channels , 1984, IEEE Trans. Inf. Theory.
[13] Venkat Anantharam,et al. Improved cardinality bounds on the auxiliary random variables in Marton's inner bound , 2013, 2013 IEEE International Symposium on Information Theory.
[14] Mark H. A. Davis,et al. Capacity and cutoff rate for Poisson-type channels , 1980, IEEE Trans. Inf. Theory.
[15] Y. Kabanov. The Capacity of a Channel of the Poisson Type , 1978 .
[16] Shlomo Shamai,et al. On the Capacity Bounds for Poisson Interference Channels , 2015, IEEE Transactions on Information Theory.
[17] Patrick P. Bergmans,et al. Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.
[18] Abbas El Gamal,et al. The capacity of a class of broadcast channels , 1979, IEEE Trans. Inf. Theory.
[19] Donald L. Snyder,et al. Some implications of the cutoff-rate criterion for coded direct-detection optical communication systems , 1980, IEEE Trans. Inf. Theory.
[20] Shlomo Shamai,et al. The Poisson Multiple-Access Channel , 1998, IEEE Trans. Inf. Theory.
[21] Chandra Nair,et al. Capacity regions of two new classes of 2-receiver broadcast channels , 2009, 2009 IEEE International Symposium on Information Theory.
[22] Chandra Nair,et al. On the inner and outer bounds for 2-receiver discrete memoryless broadcast channels , 2008, 2008 Information Theory and Applications Workshop.
[23] Emre Telatar,et al. On wide-band broadcast channels , 2003, IEEE Trans. Inf. Theory.
[24] Thomas M. Cover,et al. Network Information Theory , 2001 .
[25] Lele Wang,et al. A comparison of superposition coding schemes , 2013, 2013 IEEE International Symposium on Information Theory.
[26] A. Sridharan. Broadcast Channels , 2022 .
[27] Abbas El Gamal,et al. An outer bound to the capacity region of the broadcast channel , 2006, ISIT.
[28] Marten van Dijk. On a special class of broadcast channels with confidential messages , 1997, IEEE Trans. Inf. Theory.