Skip to main content
SpringerLink
Log in

LDPC codes from the Hermitian curve

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

In this paper, we study the code \(\mathbf{C}\) which has as parity check matrix \(\mathbf{H}\) the incidence matrix of the design of the Hermitian curve and its (q + 1)-secants. This code is known to have good performance with an iterative decoding algorithm, as shown by Johnson and Weller in (Proceedings at the ICEE Globe com conference, Sanfrancisco, CA, 2003). We shall prove that \(\mathbf{C}\) has a double cyclic structure and that by shortening in a suitable way \(\mathbf{H}\) it is possible to obtain new codes which have higher code-rate. We shall also present a simple way to constructing the matrix \(\mathbf{H}\) via a geometric approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Boros E, Szönyi T (1986) On the sharpness of a theorem of B. Segre. Combinatorica 6:261–268

    MATH  MathSciNet  Google Scholar 

  2. Bose R.C (1963) Strongly regular graphs, partial geometries and partially balanced designs. Pacific J Math 13(2):389–419

    MATH  MathSciNet  Google Scholar 

  3. Cohen S.D (1990) Primitive elements and polynomials with arbitrary trace. Disc Math 83(1):1–7

    Article  MATH  Google Scholar 

  4. Cossidente A (1997) On Kestenband-Ebert partition. J Comb Des 5(5):367–375

    Article  MATH  MathSciNet  Google Scholar 

  5. Drudge K (2002) On the orbits of Singer groups and their subgroups. Elec J Comb 9:R15 (eletronic)

    Google Scholar 

  6. Fisher JC, Hirschfeld JWP, Thas JA (1986) Complete arcs in planes of square order. Ann Discr Math 30:243–250

    MathSciNet  Google Scholar 

  7. Gallager RG (1962) Low-density parity check codes. IRE Trans Inform Theory IT-8(1):21–28

    Article  MathSciNet  Google Scholar 

  8. Hang H, Xu J, Lin S, Khaled AS (2005) Abdel Ghaffar, Codes on Finite Geometries. IEEE Trans Inf Theory 51(2):572–596

    Article  Google Scholar 

  9. Hiss G (2004) Hermitian function fields, classical unitals and representation of 3-dimensional unitary groups. Indag Math (N.S.) 15:223–243

    Article  MATH  MathSciNet  Google Scholar 

  10. Johnson SJ, Weller SR (2003) High-rate LDPC codes from unital designs. In Proceedings of the IEEE Globecom Conference, San Francisco, CA, 1–5 December 2003

  11. Johnson SJ, Weller SR (2004) Codes for iterative decoding from partial geometries. IEEE Trans Comm 52(2):236–243

    Article  Google Scholar 

  12. Kou Y, Lin S, Fossorier MPC (2001) Low-density parity check codes based on finite geometries: a rediscovery and new results. IEEE Trans Inf Theory 47(7):2711–2736

    Article  MATH  MathSciNet  Google Scholar 

  13. Lidl R, Niederreiter H (1997) Finite fields, Cambridge University Press, Cambridge

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Applicazioni “R. Caccioppoli”, Università degli Studi di Napoli Federico II, via Cintia, Monte S. Angelo, I-80126, Napoli, Italy

    Valentina Pepe

Authors
  1. Valentina Pepe
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Valentina Pepe.

Additional information

Communicated by J.D. Key.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pepe, V. LDPC codes from the Hermitian curve. Des Codes Crypt 42, 303–315 (2007). https://doi.org/10.1007/s10623-006-9036-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-006-9036-3

Keywords

AMS Classifications

Search

Navigation