On the Existence of Universally Decodable Matrices

DOI10.1109/TIT.2007.899482zbMATH Open1325.94097arXivcs/0601066MaRDI QIDQ3548925FDOQ3548925

Authors: Ashwin Ganesan, Pascal O. Vontobel 

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Universally decodable matrices (UDMs) can be used for coding purposes when transmitting over slow fading channels. These matrices are parameterized by positive integers $L$ and $N$ and a prime power $q$. The main result of this paper is that the simple condition $Lleqq+1$ is both necessary and sufficient for $(L,N,q)$-UDMs to exist. The existence proof is constructive and yields a coding scheme that is equivalent to a class of codes that was proposed by Rosenbloom and Tsfasman. Our work resolves an open problem posed recently in the literature.

Full work available at URL: https://arxiv.org/abs/cs/0601066

Recommendations

• On universally decodable matrices for space-time coding
• Higher genus universally decodable matrices (UDMG)
• On the characterization of linear uniquely decodable codes
• scientific article; zbMATH DE number 2124957
• scientific article; zbMATH DE number 1498796

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Cited In (5)

• On universally decodable matrices for space-time coding
• Title not available (Why is that?)
• Fourier-reflexive partitions and MacWilliams identities for additive codes
• Higher genus universally decodable matrices (UDMG)
• Hierarchical erasure correction of linear codes

This page was built for publication: On the Existence of Universally Decodable Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548925)