On the complexity of ml lattice decoders for decoding linear full rate space-time codes
- 1 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A new family of full rate, fully diverse space-time codes based on Galois theoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Closest point search in latticesIEEE Transactions on Information Theory, 2002
- Lattice code decoder for space-time codesIEEE Communications Letters, 2000
- A universal lattice code decoder for fading channelsIEEE Transactions on Information Theory, 1999