On the Existence of Universally Decodable Matrices

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.

Keywords

Information Theory, Discrete Mathematics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/133581

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0601066
 http://arxiv.org/abs/cs/0601066

Collections

arXiv