On the Existence of Universally Decodable Matrices
| dc.creator | Ganesan, Ashwin | |
| dc.creator | Vontobel, Pascal O. | |
| dc.date | 2006-01-14 | |
| dc.date.accessioned | 2026-07-07T08:15:50Z | |
| dc.date.available | 2026-07-07T08:15:50Z | |
| dc.description | 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 $L \leq q+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. | |
| dc.identifier | https://arxiv.org/abs/cs/0601066 | |
| dc.identifier | http://arxiv.org/abs/cs/0601066 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133581 | |
| dc.subject | Information Theory | |
| dc.subject | Discrete Mathematics | |
| dc.title | On the Existence of Universally Decodable Matrices | |
| dc.type | text |