Title :
A fast parallel decoding algorithm for general one-point AG codes with a systolic array architecture
Author :
Kurihara, Masazumi ; Sakata, Shojiro
Author_Institution :
Dept. of Comput. Sci. & Inf. Math., Univ. of Electro-Commun., Tokyo, Japan
Abstract :
We propose a fast parallel decoding algorithm for general one-point algebraic geometric (1-pt AG) codes with a systolic array architecture (SAA). This algorithm is able to correct up to half the Feng-Rao (see IEEE Trans. IT, vo1.39, no.1, p.37-45, 1993) bound and the time complexity is O(n) by using a series of O(n) processors where n is the code length and each processor is composed of τ cells for the smallest non-zero and non-gap value τ
Keywords :
algebraic geometric codes; computational complexity; decoding; parallel algorithms; systolic arrays; Feng-Rao bound; code length; fast parallel decoding algorithm; general one-point AG codes; general one-point algebraic geometric codes; nongap value; nonzero value; processors; systolic array architecture; time complexity; Concurrent computing; Cost accounting; Decoding; Error correction; Galois fields; Polynomials; Reed-Solomon codes; Systolic arrays;
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
DOI :
10.1109/ISIT.1995.531303
