On universally decodable matrices for space-time coding

Designs, Codes, and Cryptography

Volumn 41, Issue 3, 2006, Pages 325-342

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

^a HEWLETT PACKARD LABORATORIES   (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Coding for slow fading channels; Efficient decoding; Hasse derivatives; Newton interpolation; Pascal's triangle; Rank condition; Reed Solomon codes; Repeated root cyclic codes; Rosenbloom Tsfasman metric; Universally decodable matrices

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); PROBLEM SOLVING;

HASSE DERIVATIVES; REPEATED-ROOT CYCLIC CODES; ROSENBLOOM-TSFASMAN METRIC; UNIVERSALLY DECODABLE MATRICES;

MATRIX ALGEBRA;

EID: 33751535254     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-006-9019-4     Document Type: Article

References (27)

1. Blahut RE (2002) Algebraic codes for data transmission. Cambridge University Press, Cambridge
2. Castagnoli G Massey JL Schoeller PA von Seemann N (1991) On repeated-root cyclic codes. IEEE Trans Inform Theory IT-37 (2): 337-342.
3. Chen CL (1969) Some results on algebraically structured error-correcting codes. Ph.D. thesis, University of Hawaii, Honolulu, HI, USA
4. Chen WWL Skriganov MM (2002) Explicit constructions in the classical mean squares problem in irregularities of point distribution. J Reine Angew Math 545: 67-95
5. Doshi V (2005) Explicit permutation codes for the slow fading parallel channel. BS Thesis, ECE Dept., University of Illinois at Urbana-Champaign
6. k) with a non-Hamming metric and uniform distributions. Des Codes Cryptogr 33: 45-61
7. Dougherty ST Skriganov MM (2002) MacWilliams duality and the Rosenbloom-Tsfasman metric. Mosc Math J 2: 83-99
8. Dougherty ST Skriganov MM (2002) Maximum distance separable codes in the ρ metric over arbitrary alphabets. J Algebraic Combin 16: 71-81
9. Fine NJ (1947) Binomial coefficients modulo a prime. Amer Math Monthly, 54(10), 589-592 [part 1]
10. Ganesan A Boston N (2005) Universally decodable matrices. In: Proceedings of the 43rd Allerton Conf. on Communications, Control, and Computing. Allerton House, Monticello, IL USA, 28-30 September 2005
11. Ganesan A, Vontobel PO (2006) On the existence of universally decodable matrices, Submitted to IEEE Trans Inform Theory, available online under http://www.arxiv.org/abs/cs.IT/0601066+
12. Hasse H (1936) Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik. J Reine Ang Math 175: 50-54
13. Lee K (2003) The automorphism group of a linear space with the Rosenbloom-Tsfasman metric. Eur J Combin 24(6): 607-612
14. MacWilliams FJ Sloane NJA (1977) The theory of error-correcting codes. North-Holland, New York
15. Martin WJ Stinson DR (1999) Association schemes for ordered orthogonal arrays and (T, M, S)-nets. Can J Math 51(2): 326-346
16. Morelos-Zaragoza R (1991) A note on repeated-root cyclic codes. IEEE Trans Inform Theory IT-37(6): 1736-1737
17. Nielsen RR (2000) A class of Sudan-decodable codes. IEEE Trans Inform Theory IT-46(4): 1564-1572
18. Rosenbloom MY Tsfasman MA (1997) Codes for the m-metric. Probl Inform Transm 33(1): 45-52
19. Skriganov MM (2001) Coding theory and uniform distributions. Algebra i Analiz 13(2): 191-239
20. Sokolnikoff IS Redheffer RM (1966) Mathematics of physics and modern engineering, 2nd edn. McGraw-Hill Book Co., New York
21. Stichtenoth H (1993) Algebraic function fields and codes. Universitext, Springer-Verlag, Berlin
22. Tavildar S Viswanath P (2006) Approximately universal codes over slow-fading channels. IEEE Trans Inform Theory IT-52:(7): 3233-3258
23. Tse D Viswanath P (2005) Fundamentals of wireless communication. Cambridge University Press, Cambridge, UK
24. van der Geer O van der Vlugt M (2006) Table of curves with many points (version of January 28,2006), available online under http://www.science.uva.nl/ geer/tables-mathcomp17.pdf
25. van Lint JH (1991) Repeated-root cyclic codes. IEEE Trans Inform Theory 37:(2): 343-345
26. Vontobel PO, Ganesan A (2005) An explicit construction of universally decodable matrices, Technical report, August 2005, available online under http://www.arxiv.org/abs/cs.IT/0508098
27. Vontobel PO, Ganesan A (2005) On universally decodable matrices for space-time coding. In: Proceedings of the Inaugural Workshop of the Center for Information Theory and its Applications (UC San Diego, La Jolla, CA, USA), 6-1.0 February 2006, available online under http://www.arxiv.org/abs/cs.IT/0601075v1