A Compact Construction for LDPC Codes using Permutation Polynomials

@article{Takeshita2006ACC,
  title={A Compact Construction for LDPC Codes using Permutation Polynomials},
  author={O. Takeshita},
  journal={2006 IEEE International Symposium on Information Theory},
  year={2006},
  pages={79-82}
}
  • O. Takeshita
  • Published 2006 in
    2006 IEEE International Symposium on Information…
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… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…