DocumentCode
566532
Title
A fast parallel algorithm for Decoding Algebraic Geometry Codes
Author
Fu, Xiaohui ; Yang, Junjian
Author_Institution
Sch. of Math. & Stat., Hainan Normal Univ., Haikou, China
Volume
1
fYear
2012
fDate
24-26 April 2012
Firstpage
156
Lastpage
159
Abstract
This paper deals with how to compute a nontrivial element efficiently in the kernel of a given structured matrix by parallel algorithm. This parallel algorithm is using the displacement rank method of a structured matrix with the computational complexity O(αn).
Keywords
computational complexity; decoding; matrix algebra; parallel algorithms; algebraic geometry codes decoding; computational complexity; displacement rank method; fast parallel algorithm; nontrivial element computation; parallel algorithm; structured matrix; Decoding; Equations; Geometry; Kernel; Parallel algorithms; Phase change random access memory; Program processors;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing Technology and Information Management (ICCM), 2012 8th International Conference on
Conference_Location
Seoul
Print_ISBN
978-1-4673-0893-9
Type
conf
Filename
6268487
Link To Document