A Basis for all Solutions of the Key Equation for Gabidulin Codes

Details A Basis for all Solutions of the Key Equation for Gabidulin Codes A Basis for all Solutions of the Key Equation for Gabidulin Codes

2010-06-09

arxiv.org/abs/1006.1743v1

Computer Science

Information Theory

accepted for ISIT 2010, Austin, TX, USA

Scientific paper

We present and prove the correctness of an efficient algorithm that provides a basis for all solutions of a key equation in order to decode Gabidulin (G-) codes up to a given radius tau. This algorithm is based on a symbolic equivalent of the Euclidean Algorithm (EA) and can be applied for decoding of G-codes beyond half the minimum rank distance. If the key equation has a unique solution, our algorithm reduces to Gabidulin's decoding algorithm up to half the minimum distance. If the solution is not unique, we provide a basis for all solutions of the key equation. Our algorithm has time complexity O(tau^2) and is a generalization of the modified EA by Bossert and Bezzateev for Reed-Solomon codes.

Affiliated with

Also associated with

No associations

Rating

A Basis for all Solutions of the Key Equation for Gabidulin 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 A Basis for all Solutions of the Key Equation for Gabidulin Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Basis for all Solutions of the Key Equation for Gabidulin Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-39527