Finite-SNR regime analysis of the Gaussian wiretap multiple-access channel
暂无分享,去创建一个
Panagiotis Papadimitratos | Somayeh Salimi | Parisa Babaheidarian | Panos Papadimitratos | P. Babaheidarian | Somayeh Salimi
[1] Uri Erez,et al. The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel , 2014, IEEE Trans. Inf. Theory.
[2] Ender Tekin,et al. The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming , 2007, IEEE Transactions on Information Theory.
[3] Thomas M. Cover,et al. Network Information Theory , 2001 .
[4] G. David Forney,et al. On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener , 2004, ArXiv.
[5] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[6] Amir K. Khandani,et al. On the Secure Degrees-of-Freedom of the Multiple-Access-Channel , 2010, ArXiv.
[7] János Körner,et al. How to encode the modulo-two sum of binary sources (Corresp.) , 1979, IEEE Trans. Inf. Theory.
[8] Aylin Yener,et al. Providing Secrecy With Structured Codes: Two-User Gaussian Channels , 2014, IEEE Transactions on Information Theory.
[9] A. D. Wyner,et al. The wire-tap channel , 1975, The Bell System Technical Journal.
[10] Abbas El Gamal,et al. Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).
[11] Somayeh Salimi,et al. Compute-and-forward can buy secrecy cheap , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[12] Michael Gastpar,et al. Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.
[13] D. Harville. Matrix Algebra From a Statistician's Perspective , 1998 .