Shifted inverse determinant sums and new bounds for the DMT of space-time lattice codes
暂无分享,去创建一个
[1] Lizhong Zheng,et al. Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.
[2] Frédérique E. Oggier,et al. An Error Probability Approach to MIMO Wiretap Channels , 2011, IEEE Transactions on Communications.
[3] Camilla Hollanti,et al. Reducing complexity with less than minimum delay space-time lattice codes , 2011, 2011 IEEE Information Theory Workshop.
[4] Roope Vehkalahti,et al. Inverse Determinant Sums and Connections Between Fading Channel Information Theory and Algebra , 2011, IEEE Transactions on Information Theory.
[5] Pramod Viswanath,et al. Approximately universal codes over slow-fading channels , 2005, IEEE Transactions on Information Theory.
[6] Amir K. Khandani,et al. On the Limitations of the Naive Lattice Decoding , 2010, IEEE Transactions on Information Theory.
[7] A. Robert Calderbank,et al. Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.
[8] Roope Vehkalahti,et al. A new design criterion for spherically-shaped division algebra-based space-time codes , 2013, 2013 IEEE Information Theory Workshop (ITW).