Skip to main content
SpringerLink
Log in

Absorbing Set Analysis of Codes from Affine Planes

  • Conference paper
  • First Online:
Coding Theory and Applications (ICMCTA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10495))

Included in the following conference series:

Abstract

We examine the presence of absorbing sets, fully absorbing sets, and elementary absorbing sets in low-density parity-check (LDPC) codes arising from certain classes of finite geometries. In particular, we analyze the absorbing set spectra of LDPC codes from finite Euclidean planes. For some parameters, we classify the absorbing sets present and give exact counts on their multiplicities.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Amiri, B., Lin, C.W., Dolecek, L.: Asymptotic distribution of absorbing sets and fully absorbing sets for regular sparse code ensembles. IEEE Trans. Commun. 61(2), 455–464 (2013)

    Article  Google Scholar 

  2. Ball, S., Weiner, Z.: An introduction to finite geometry. Preprint (2011)

    Google Scholar 

  3. Batten, L.M.: Combinatorics of Finite Geometries, 2nd edn. Cambridge University Press, Cambridge (1997)

    Book  MATH  Google Scholar 

  4. Di, C., Proietti, D., Telatar, I.E., Richardson, T.J., Urbanke, R.L.: Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Trans. Inform. Theory 48(6), 1570–1579 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Diao, Q., Tai, Y.Y., Lin, S., Abdel-Ghaffar, K.: Trapping set structure of LDPC codes on finite geometries. In: Information Theory and Applications Workshop (ITA), pp. 1–8. IEEE (2013)

    Google Scholar 

  6. Dolecek, L.: On absorbing sets of structured sparse graph codes. In: Information Theory and Applications Workshop (ITA), pp. 1–5. IEEE (2010)

    Google Scholar 

  7. Dolecek, L., Zhang, Z., Anantharam, V., Wainwright, M., Nikolic, B.: Analysis of absorbing sets for array-based LDPC codes. In: IEEE International Conference on Communications, pp. 6261–6268 (2007)

    Google Scholar 

  8. Feldman, J., Wainwright, M.J., Karger, D.R.: Using linear programming to decode binary linear codes. IEEE Trans. Inform. Theory 51(3), 954–972 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hirschfeld, J.W., Storme, L.: The packing problem in statistics, coding theory and finite projective spaces: update 2001. In: Finite Geometries, pp. 201–246. Springer, US (2001)

    Google Scholar 

  10. Johnson, S.J., Weller, S.R.: Codes for iterative decoding from partial geometries. IEEE Trans. Commun. 52(2), 236–243 (2004)

    Article  Google Scholar 

  11. Kelley, C.A., Sridhara, D., Rosenthal, J.: Tree-based construction of LDPC codes having good pseudocodeword weights. IEEE Trans. Inform. Theory 53(4), 1460–1478 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Koetter, R., Vontobel, P.O.: Graph covers and iterative decoding of finite-length codes. In: Proceedings of the 3rd International Symposium on Turbo Codes and Related Topics, Brest, France, pp. 75–82 (2003)

    Google Scholar 

  13. Kou, Y., Lin, S., Fossorier, M.: Construction of low density parity check codes: a geometric approach. In: 2nd IEEE International Symposium on Turbo Codes and Related Topics, Brest, France, pp. 137–140 (2000)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. Kyung, G.B., Wang, C.C.: Finding the exhaustive list of small fully absorbing sets and designing the corresponding low error-floor decoder. IEEE Trans. Commun. 60(6), 1487–1498 (2012)

    Article  Google Scholar 

  16. Landner, S., Milenkovic, O.: Algorithmic and combinatorial analysis of trapping sets in structured ldpc codes. In: Wireless Networks, Communications, and Mobile Computing, vol. 1, pp. 630–635. IEEE (2005)

    Google Scholar 

  17. Liu, H., Li, Y., Ma, L., Chen, J.: On the smallest absorbing sets of LDPC codes from finite planes. IEEE Trans. Inform. Theory 58(6) (2012)

    Google Scholar 

  18. Richardson, T.: Error floors of LDPC codes. In: Proceedings of the Annual Allerton Conference on Communication, Control, and Computing, vol. 41 (2003)

    Google Scholar 

  19. Schwartz, M., Vardy, A.: On the stopping distance and the stopping redundancy of codes. IEEE Trans. Inform. Theory 52, 922–932 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  20. Tang, H., Xu, J., Lin, S., Abdel-Ghaffar, K.A.S.: Codes on finite geometries. IEEE Trans. Inform. Theory 51(2), 572–596 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  21. Tanner, R.M.: Explicit concentrators from generalized \(n\)-gons. SIAM J. Algebraic Discrete Methods 5(3), 287–293 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  22. Xia, S.T., Fu, F.W.: On the stopping distance of finite geometry LDPC codes. IEEE Commun. Lett. 10(5), 381–383 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Villanova University, 800 E. Lancaster Ave, Villanova, PA, 19085, USA

    Kathryn Haymaker

Authors
  1. Kathryn Haymaker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kathryn Haymaker .

Editor information

Editors and Affiliations

  1. University of Valladolid, Valladolid, Spain

    Ángela I. Barbero

  2. University of Tartu, Tartu, Estonia

    Vitaly Skachek

  3. Simula@UiB and University of Bergen, Bergen, Norway

    Øyvind Ytrehus

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Haymaker, K. (2017). Absorbing Set Analysis of Codes from Affine Planes. In: Barbero, Á., Skachek, V., Ytrehus, Ø. (eds) Coding Theory and Applications. ICMCTA 2017. Lecture Notes in Computer Science(), vol 10495. Springer, Cham. https://doi.org/10.1007/978-3-319-66278-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66278-7_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66277-0

  • Online ISBN: 978-3-319-66278-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation