ℓp-norms of codewords from capacity- and dispersion-achieveing Gaussian codes
暂无分享,去创建一个
[1] Udo Augustin,et al. GedÄchtnisfreie KanÄle für diskrete Zeit , 1966 .
[2] I. J. Schoenberg. On a Theorem of Kirzbraun and Valentine , 1953 .
[3] H. Vincent Poor,et al. Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.
[4] S. Bobkov,et al. Exponential Integrability and Transportation Cost Related to Logarithmic Sobolev Inequalities , 1999 .
[5] Sergio Verdú,et al. Relative entropy at the channel output of a capacity-achieving code , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[6] R. Ahlswede. An elementary proof of the strong converse theorem for the multiple-access channel , 1982 .
[7] H. Vincent Poor,et al. Channel coding: non-asymptotic fundamental limits , 2010 .
[8] Sergio Verdú,et al. Empirical distribution of good channel codes with non-vanishing error probability (extended version) , 2013, ArXiv.
[9] S. Varadhan,et al. Asymptotic evaluation of certain Markov process expectations for large time , 1975 .
[10] V. Sudakov,et al. Extremal properties of half-spaces for spherically invariant measures , 1978 .