An Explicit Construction of Universally Decodable Matrices

Details An Explicit Construction of Universally Decodable Matrices An Explicit Construction of Universally Decodable Matrices

2005-08-23

arxiv.org/abs/cs/0508098v1

Computer Science

Information Theory

Scientific paper

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 \leq q+1$. This is the largest set of possible parameter values since for any list of universally decodable matrices the value $L$ is upper bounded by $q+1$, except for the trivial case $n = 1$. For the proof of our construction we use properties of Hasse derivatives, and it turns out that our construction has connections to Reed-Solomon codes, Reed-Muller codes, and so-called repeated-root cyclic codes. Additionally, we show how universally decodable matrices can be modified so that they remain universally decodable matrices.

Affiliated with

Also associated with

No associations

Rating

An Explicit Construction of Universally Decodable Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Explicit Construction of Universally Decodable Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Explicit Construction of Universally Decodable Matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-165810