DocumentCode
1714965
Title
A note on relationship between algebraic geometric codes and LDPC codes
Author
Hu, Wanbao ; Cai, Huaping ; Wu, Yanxia ; Wang, Zhen
Author_Institution
Dept. of Math., Anqing Teachers Coll., Anqing, China
Volume
1
fYear
2010
Abstract
Low-density parity-check (LDPC) codes constructed by a sparse parity-check matrix are of very fast encoding and decoding algorithms. Another kind of codes, which improved the well-known Gilbert-Varshamov bound, are algebraic geometry codes (Goppa geometry codes) from algebraic curves over finite fields. In the note, we analyze their characteristic of the two class of codes and show that the algebraic geometric codes are seldom LDPC codes.
Keywords
algebraic geometric codes; decoding; parity check codes; sparse matrices; Gilbert-Varshamov bound; LDPC code; algebraic curves; algebraic geometric code; decoding algorithm; encoding algorithm; low density parity check code; sparse parity check matrix; Construction industry; Galois fields; Geometry; Null space; Parity check codes; Signal processing algorithms; Sparse matrices; Error-correcting code; algebraic geometry code (Goppa geometry code); low-density parity-check (LDPC)code;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Systems (ICSPS), 2010 2nd International Conference on
Conference_Location
Dalian
Print_ISBN
978-1-4244-6892-8
Electronic_ISBN
978-1-4244-6893-5
Type
conf
DOI
10.1109/ICSPS.2010.5555509
Filename
5555509
Link To Document