Abstract
Multipoint codes are a broad class of algebraic geometry codes derived from algebraic functions, which have multiple poles and/or zeros on an algebraic curve. Thus, they are more general than one-point codes, which are an important class of algebraic geometry codes in the sense that they can be decoded efficiently using the Berlekamp-Massey-Sakata algorithm. We present a fast method for decoding multipoint codes from a plane curve, particularly a Hermitian curve. Our method with some adaptation can be applied to decode multipoint codes from a general algebraic curve embedded in the N-dimensional affine space Fq <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</sup> over a finite field F <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">q</sub> , so that those algebraic geometry codes can be decoded efficiently if the dimension N of the affine space, including the defining curve is small.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
