DocumentCode
1086163
Title
Decoding of codes defined by a single point on a curve
Author
O´Sullivan, Michael E.
Author_Institution
California Univ., Berkeley, CA, USA
Volume
41
Issue
6
fYear
1995
fDate
11/1/1995 12:00:00 AM
Firstpage
1709
Lastpage
1719
Abstract
A decoding algorithm for certain codes from algebraic curves is presented. The dual code, which is used for decoding, is formed by evaluating rational functions having poles at a single point. A theoretical foundation is developed from which an improved bound for the minimum distance and results on decoding up to that bound are derived. The decoding is done by a computationally efficient Berlekamp-Massey type algorithm, which is intrinsic to the curve
Keywords
algebraic geometric codes; decoding; dual codes; functions; iterative methods; poles and zeros; algebraic curves; computationally efficient Berlekamp-Massey type algorithm; decoding algorithm; dual code; minimum distance bound; poles; rational functions; Algorithm design and analysis; Computational complexity; Computational geometry; Information theory; Iterative algorithms; Iterative decoding; Polynomials; Reed-Solomon codes; Technological innovation;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.476244
Filename
476244
Link To Document