On the existence of universally decodable matrices

IEEE Transactions on Information Theory

Volumn 53, Issue 7, 2007, Pages 2572-2575

  Ganesan, Ashwin ^a   Vontobel, Pascal O ^a,b  

^a University of Wisconsin Madison   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Coding for slow fading channels; Full rank condition; Rosenbloom Tsfasman codes; Universally decodable matrices (UDM)

Indexed keywords

POSITIVE INTEGERS; ROSENBLOOM-TSFASMAN CODES; SLOW FADING CHANNELS; UNIVERSALLY DECODABLE MATRICES (UDM);

CODES (SYMBOLS); DECODING; ENCODING (SYMBOLS); INFORMATION THEORY; MATRIX ALGEBRA;

FADING CHANNELS;

EID: 34447321844     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.899482     Document Type: Article

References (9)

1. A. Ganesan and N. Boston, "Universally decodable matrices," in Proc. 43rd Allerton Conf. Communications, Control, and Computing, Monticello, IL, Sep. 2005, pp. 2123-2128.
2. S. Tavildar and P. Viswanath, "Approximately universal codes over slow-fading channels," IEEE Trans. Inf. Theory, vol. 52, no. 7, pp. 3233-3258, Jul. 2006.
3. S. Tavildar and P. Viswanath, ?Approximately Universal Codes over Slow Fading Channels.? 2005 Online. Available: http://arxiv.org/abs/cs/ 0512017v1.
4. V. Doshi, "Explicit Permutation Codes for the Slow Fading Parallel Channel," B.S. thesis, Electrical and Computer Engineering Dep., Univ. Illinois at Urbana-Champaign, Urbana, IL, 2005.
5. M. Y. Rosenbloom and M. A. Tsfasman, "Codes for the m-metric," Probl. Inf. Transm., vol. 33, no. 1, pp. 45-52, 1997.
6. P. O. Vontobel and A. Ganesan, An Explicit Construction of Universally Decodable Matrices, 2005, Tech. Rep. Online. Available: http://www.arxiv.org/abs/cs.IT/0508098.
7. P. O. Vontobel and A. Ganesan, "On universally decodable matrices for space-time coding," Des. Codes Cryptogr., vol. 41, pp. 325-342, Dec. 2006.
8. H. Hasse, "Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik," J. Reine. Ang. Math., vol. 175, pp. 50-54, 1936.
9. R. R. Nielsen, "A class of Sudan-decodable codes," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1564-1572, Jul. 2000.