DocumentCode :
2362748
Title :
Low density parity check irreducible Goppa codes
Author :
Kubwalo, Paul F. ; Ryan, John A.
Author_Institution :
Mzuzu Univ., Mzuzu
fYear :
2007
fDate :
26-28 Sept. 2007
Firstpage :
1
Lastpage :
8
Abstract :
In this paper, whose earlier version was presented at SAMSA 05 conference, we present some of the results obtained in the on-going research on low density parity check (LDPC) irreducible Goppa codes. The objective of the research is to find irreducible Goppa codes with sparse parity check matrices to which LDPC decoding can be applied. If such codes are found then they would permit efficient encoding and decoding algorithms. We use two methods to come up with a sparse parity check matrix. The first method involves changing the basis of the splitting field of the Goppa polynomial. In the other method, we build the parity check matrix using low weight codewords in the dual code of the Goppa code.
Keywords :
Goppa codes; matrix algebra; parity check codes; polynomials; Goppa polynomial; LDPC decoding; SAMSA 05 conference; irreducible Goppa codes; low density parity check codes; sparse parity check matrices; Belief propagation; Bipartite graph; Decoding; Encoding; Hardware; Linear code; Mathematics; Parity check codes; Polynomials; Sparse matrices;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
AFRICON 2007
Conference_Location :
Windhoek
Print_ISBN :
978-1-4244-0987-7
Electronic_ISBN :
978-1-4244-0987-7
Type :
conf
DOI :
10.1109/AFRCON.2007.4401460
Filename :
4401460
Link To Document :
بازگشت