A New Construction for LDPC Codes using Permutation Polynomials over Integer Rings

@article{Takeshita2005ANC,
  title={A New Construction for LDPC Codes using Permutation Polynomials over Integer Rings},
  author={Oscar Y. Takeshita},
  journal={CoRR},
  year={2005},
  volume={abs/cs/0506091}
}
A new construction is proposed for low density parity check (LDPC) codes using quadratic permutation polynomials over finite integer rings. The associated graphs for the new codes have both algebraic and pseudorandom nature, and the new codes are quasi-cyclic. Graph isomorphisms and automorphisms are identified and used in an efficient search for good codes… CONTINUE READING