Title :
A Compact Construction for LDPC Codes using Permutation Polynomials
Author :
Takeshita, Oscar Y.
Author_Institution :
Dept. of Electr. & Comput. Eng., Ohio State Univ., Columbus, OH
Abstract :
A construction is proposed for low density parity check codes using quadratic permutation polynomials over finite integer rings. Graph isomorphisms and automorphisms are identified and used in an efficient search for good codes. Graphs with girth as large as 12 were found. Upper bounds on the minimum Hamming distance are found algorithmically. The bounds indicate that the minimum distance grows with block length. One of the new codes has a similar error performance as the best known PEG LDPC code. Finally, the new codes are quasi-cyclic
Keywords :
Hamming codes; parity check codes; polynomials; Hamming distance; LDPC codes; automorphisms; finite integer rings; graph isomorphisms; low density parity check codes; quadratic permutation polynomials; Bipartite graph; Combinatorial mathematics; Computer errors; Computer simulation; Hamming distance; Parity check codes; Polynomials; Sufficient conditions; Upper bound; Writing;
Conference_Titel :
Information Theory, 2006 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
1-4244-0505-X
Electronic_ISBN :
1-4244-0504-1
DOI :
10.1109/ISIT.2006.261678
