LDPC codes from Singer cycles

@article{Giuzzi2009LDPCCF,
  title={LDPC codes from Singer cycles},
  author={Luca Giuzzi and Angelo Sonnino},
  journal={Discret. Appl. Math.},
  year={2009},
  volume={157},
  pages={1723-1728}
}
  • Luca Giuzzi, Angelo Sonnino
  • Published 2009
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • The main goal of coding theory is to devise efficient systems to exploit the full capacity of a communication channel, thus achieving an arbitrarily small error probability. Low Density Parity Check (LDPC) codes are a family of block codes-characterised by admitting a sparse parity check matrix-with good correction capabilities. In the present paper the orbits of subspaces of a finite projective space under the action of a Singer cycle are investigated. The incidence matrix associated to each… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-4 OF 4 CITATIONS

    Codes and caps from orthogonal Grassmannians

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Some results on caps and codes related to orthogonal Grassmannians - a preview

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Families of twisted tensor product codes

    VIEW 1 EXCERPT
    CITES RESULTS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 19 REFERENCES