An Algebraic Approach for Decoding Spread Codes

Details An Algebraic Approach for Decoding Spread Codes An Algebraic Approach for Decoding Spread Codes

2011-07-27

arxiv.org/abs/1107.5523v3

Computer Science

Information Theory

Scientific paper

In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family of optimal codes with maximal minimum distance. We give a minimum-distance decoding algorithm which requires O((n-k)k^3) operations over an extension field F_{q^k}. Our algorithm is more efficient than the previous ones in the literature, when the dimension k of the codewords is small with respect to n. The decoding algorithm takes advantage of the algebraic structure of the code, and it uses original results on minors of a matrix and on the factorization of polynomials over finite fields.

Affiliated with

Also associated with

No associations

Rating

An Algebraic Approach for Decoding Spread 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 An Algebraic Approach for Decoding Spread Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algebraic Approach for Decoding Spread Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-113638