Achieving capacity and security in wireless communications with lattice codes
暂无分享,去创建一个
[1] David Tse,et al. Fundamentals of Wireless Communication , 2005 .
[2] Roope Vehkalahti,et al. Almost Universal Codes Achieving Ergodic MIMO Capacity Within a Constant Gap , 2015, IEEE Transactions on Information Theory.
[3] Ling Liu,et al. Polar lattices are good for lossy compression , 2015, 2015 IEEE Information Theory Workshop - Fall (ITW).
[4] Rafael F. Schaefer,et al. The Secrecy Capacity of Compound Gaussian MIMO Wiretap Channels , 2015, IEEE Transactions on Information Theory.
[5] Cong Ling,et al. Almost universal codes for fading wiretap channels , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[6] Uri Erez,et al. Precoded integer-forcing universally achieves the MIMO capacity to within a constant gap , 2013, 2013 IEEE Information Theory Workshop (ITW).
[7] Uri Erez,et al. Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding , 2004, IEEE Transactions on Information Theory.
[8] Cong Ling,et al. Algebraic lattice codes achieve the capacity of the compound block-fading channel , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[9] Frédérique E. Oggier,et al. Algebraic Number Theory and Code Design for Rayleigh Fading Channels , 2004, Found. Trends Commun. Inf. Theory.
[10] Chris Peikert,et al. On Ideal Lattices and Learning with Errors over Rings , 2010, JACM.
[11] RegevOded,et al. On Ideal Lattices and Learning with Errors over Rings , 2013 .
[12] Cong Ling,et al. Semantically Secure Lattice Codes for the Gaussian Wiretap Channel , 2012, IEEE Transactions on Information Theory.
[13] Cong Ling,et al. Achieving AWGN Channel Capacity With Lattice Gaussian Coding , 2014, IEEE Transactions on Information Theory.