On universally decodable matrices for space–time coding
نویسندگان
چکیده
منابع مشابه
On universally decodable matrices for space-time coding
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of constructing UDMs is tightly connected to the problem of constructing maximum distance separable (MDS) codes. In this paper, we first study the properties of UDMs in general and then we discuss an explicit construction of a c...
متن کاملHigher genus universally decodable matrices (UDMG)
We introduce the notion of Universally Decodable Matrices of Genus g (UDMG), which for g = 0 reduces to the notion of Universally Decodable Matrices (UDM) introduced in [8]. A UDMG is a set of L matrices over a finite field Fq, each with K rows, and a linear independence condition satisfied by collections of K + g columns formed from the initial segments of the matrices. We consider the mathema...
متن کاملAn Explicit Construction of Universally Decodable Matrices
Universally decodable matrices 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. Based on Pascal’s triangle we give an explicit construction of universally decodable matrices for any non-zero integers L and n and any prime power q where L ≤ q + 1. This is the largest set of possible par...
متن کاملOn Low-Complexity Decodable Universally Good Linear Codes
Here we discuss the universal block decoding problem for memoryless systems and focus on figures of merit and linear code constructions that facilitate the analysis and construction of low-complexity decoding algorithms. We discuss the properties of ‘universally good codes’ and how such codes lie on the Gilbert-Varshamov bound. We next speak to analogues of the minimum-distance criterion and de...
متن کاملLocally Decodable Source Coding
Source coding is accomplished via the mapping of consecutive source symbols (blocks) into code blocks of fixed or variable length. The fundamental limits in source coding introduces a tradeoff between the rate of compression and the fidelity of the recovery. However, in practical communication systems many issues such as computational complexity, memory capacity, and memory access requirements ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2006
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-006-9019-4