A Note on Relationship between Algebraic Geometric Codes and LDPC Codes

摘要：

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.

关键词： Error-correcting code algebraic geometry code (Goppa geometry code) low-density parity-check (LDPC)code

作者: Wanbao Hu Huaping Cai Yanxia Wu Zhen Wang

作者单位: Department of Mathematics, Anqing teachers college Anqing, China

会议类型: 国际会议

会议名称: 2010 2nd International Conference on Signal Processing System(2010年信号处理系统国际会议 ICSPS 2010)

会议地点: 大连

会议语种:英文

页码: 56-58

在线出版日期: 2010-07-05（万方平台首次上网日期，不代表论文的发表时间）