By Topic

On the key equation

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

1 Author(s)
Fitzpatrick, P. ; Dept. of Math., Univ. Coll. Cork, Ireland

We consider the set M={(a, b):a≡bh mod x2t} of all solutions of the key equation for alternant codes, where h is the syndrome polynomial. In decoding these codes a particular solution (ω, σ)∈M is sought, subject to ω and σ being relatively prime and satisfying certain degree conditions. We prove that these requirements specify (ω, σ) uniquely as the minimal element of M (analogous to the monic polynomial of minimal degree generating an ideal of F[x]) with respect to a certain term order and that, as such, (ω, σ) may be determined from an appropriate Grobner basis of M. Motivated by this and other variations of the key equation (such as that appropriate to errors-and-erasures decoding) we derive a general algorithm for solving the congruence a≡bg mod xn for a range of term orders defined by the conditions on the particular solution required. Our techniques provide a unified approach to the solution of these key equations

Published in:

Information Theory, IEEE Transactions on  (Volume:41 ,  Issue: 5 )