| Session: | 1.1.5 - LDPC Codes: Algebraic Constructions |
| Session Time: | Monday, July 10, 09:40 - 11:00 |
| Paper Time: | Monday, July 10, 09:40 - 10:00 |
| Title: |
A Compact Construction for LDPC Codes using Permutation Polynomials |
| Authors: |
Oscar Y. Takeshita; Ohio State University | | |
| 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. |
