DocumentCode
327319
Title
A type of recurring relations on sequences and efficient decoding of a class of algebraic-geometric codes
Author
Li, Bao ; Xiao, Guo-zhen
Author_Institution
Inst. of Software Eng., Acad. Sinica, Beijing, China
fYear
1998
fDate
16-21 Aug 1998
Firstpage
94
Abstract
A type of recurring relation is introduced on sequences. Some properties of this type of recurring relations are established and an algorithm for computing a minimal polynomial set of this type of recurring relation is presented. Then an efficient decoding algorithm up to half the Feng-Rao bound for a class of algebraic-geometric codes is proposed by developing a majority voting scheme of the recurring relation on the syndrome sequence of an error vector
Keywords
algebraic geometric codes; computational complexity; decoding; polynomials; sequences; Feng-Rao bound; algebraic-geometric codes; efficient decoding; error vector; majority voting scheme; minimal polynomial set; recurring relations; sequences; syndrome sequence; Decoding; Hamming weight; Information security; Parity check codes; Polynomials; Software engineering; Vectors; Voting;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708681
Filename
708681
Link To Document