By Topic

Algebraic List-Decoding of Subspace Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mahdavifar, H. ; Dept. of Electr. & Comput. Eng., Univ. of California, San Diego, La Jolla, CA, USA ; Vardy, A.

Subspace codes are collections of subspaces of a certain ambient vector space over a finite field. Koetter and Kschischang introduced subspace codes in order to correct errors and erasures in noncoherent (random) linear network coding. They have also studied a remarkable family of subspace codes obtained by evaluating certain linearized polynomials. The Koetter-Kschischang subspace codes are widely regarded as the counterpart of Reed-Solomon codes in the domain of network error-correction. Koetter and Kschischang have furthermore devised an algebraic decoding algorithm for these codes, analogous to the Berlekamp-Welch decoding algorithm for Reed-Solomon codes. In this paper, we develop list-decoding algorithms for subspace codes, thereby providing, for certain code parameters, a better tradeoff between rate and error-correction capability than that of the Koetter-Kschischang 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, our list-L decoder guarantees successful recovery of the message subspace provided that the normalized dimension of the error satisfies τ ≤ L - L(L + 1)/2 R* where R* is the packet rate, which is a new parameter introduced in this paper. As in the case of Sudan's list-decoding algorithm, this exceeds the previously best-known error-correction radius 1 - R*, established by Koetter and Kschischang, only for low rates R*.

Published in:

Information Theory, IEEE Transactions on  (Volume:59 ,  Issue: 12 )