Computer Science – Information Theory
Scientific paper
2012-02-02
Computer Science
Information Theory
Scientific paper
Subspace codes were introduced in order to correct errors and erasures for randomized network coding, in the case where network topology is unknown (the noncoherent case). Subspace codes are indeed collections of subspaces of a certain vector space over a finite field. The Koetter-Kschischang construction of subspace codes are similar to Reed-Solomon codes in that codewords are obtained by evaluating certain (linearized) polynomials. In this paper, we consider the problem of list-decoding the Koetter-Kschischang subspace codes. In a sense, we are able to achieve for these codes what Sudan was able to achieve for Reed-Solomon codes. In order to do so, we have to modify and generalize the original Koetter-Kschischang construction in many important respects. The end result is this: for any integer $L$, our list-$L$ decoder guarantees successful recovery of the message subspace provided that the normalized dimension of the error is at most $ L - \frac{L(L+1)}{2}R $ where $R$ is the normalized packet rate. Just as in the case of Sudan's list-decoding algorithm, this exceeds the previously best known error-correction radius $1-R$, demonstrated by Koetter and Kschischang, for low rates $R$.
Mahdavifar Hessam
Vardy Alexander
No associations
LandOfFree
Algebraic List-decoding of Subspace Codes 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 Algebraic List-decoding of Subspace Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic List-decoding of Subspace Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-186629