Skip to main content
SpringerLink
Log in

The Minimum Distance of Graph Codes

  • Conference paper
Coding and Cryptology (IWCC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6639))

Included in the following conference series:

Abstract

We study codes constructed from graphs where the code symbols are associated with the edges and the symbols connected to a given vertex are restricted to be codewords in a component code. In particular we treat such codes from bipartite expander graphs coming from Euclidean planes and other geometries. We give results on the minimum distances of the codes.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tanner, M.: A Recursive Approach to Low Complexity Codes. IEEE Trans. Inform. Theory 27, 533–547 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  2. Zémor, G.: On expander codes. IEEE Trans. Inform. Theory (Special Issue on Codes on Graphs and iterative Algorithms) 47, 835–837 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Barg, A., Zémor, G.: Error exponents of expander codes. IEEE Trans. Inform. Theory 48, 1725–1729 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Tanner, M.: Explicit Concentrators from Generalized N-Gons. SIAM J. Alg. Disc. Meth. 5(3), 287–293 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  5. Tanner, M.: Minimum-Distance Bounds by Graph Analysis. IEEE Trans. Inform. Theory 47, 808–821 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  6. Sipser, M., Spielman, D.A.: Expander Codes. IEEE Trans. Inform. Theory 42(6), 1710–1722 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Davidoff, G., Sarnak, P., Valette, A.: Elementary Number Theory, Group Theory, and Ramanujan Graphs, vol. 55. London Mathematical Society, Student Texts (2003)

    Book  MATH  Google Scholar 

  8. Roth, R.M.: Introduction to Coding Theory. Cambridge University Press, Cambridge (2006)

    Book  MATH  Google Scholar 

  9. Janwa, H., Lal, A.K.: On Tanner Codes: Minimum Distance and Decoding. AAECC 13, 335–347 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Roth, R.M., Skachek, V.: Improved Nearly-MDS Expander Codes. IEEE Trans. Inform. Theory 52(8), 3650–3661 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Skachek, V.: Low-Density-Parity-Check Codes: Constructions and Bounds, Ph.D. Thesis, Technion, Haifa, Israel (January 2007)

    Google Scholar 

  12. Feit, W., Higman, G.: The nonexistence of certain generalized polygons. J. Algebra 1, 114–131 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  13. van Maldeghem, H.: Generalized Polygons. Birkhäuser-Verlag, Basel (1998)

    Book  MATH  Google Scholar 

  14. Blake, I.A., Mullin, R.C.: The Mathematical Theory of Coding. Academic Press, New York (1975)

    MATH  Google Scholar 

  15. Lauritzen, N.: Concrete Abstract Algebra. Cambridge University Press, Cambridge (2005)

    MATH  Google Scholar 

  16. Blahut, R.E.: Algebraic Codes on Lines, Planes, and Curves. Cambridge University Press, Cambridge (2008)

    Book  MATH  Google Scholar 

  17. Høholdt, T., Justesen, J.: Graph codes with Reed-Solomon component codes. In: Proceedings ISIT 2006, Seattle, Washington, pp. 2022–2026 (July 2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The Technical University of Denmark, Bldg. 303, DK 2800, Lyngby, Denmark

    Tom Høholdt & Jørn Justesen

Authors
  1. Tom Høholdt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jørn Justesen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Physical and Mathematical Sciences, Division of Mathematical Sciences, Nanyang Technological University, 637371, Singapore

    Yeow Meng Chee , San Ling , Huaxiong Wang  & Chaoping Xing , ,  & 

  2. College of Information Engineering, Qingdao University, 266071, Shandong, P.R. China

    Zhenbo Guo

  3. Qingdao University, 266071, Shandong, P.R. China

    Fengjing Shao

  4. School of Mathematical Sciences, Yangzhou University, 225002, Jiangsu, P.R. China

    Yuansheng Tang

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Høholdt, T., Justesen, J. (2011). The Minimum Distance of Graph Codes. In: Chee, Y.M., et al. Coding and Cryptology. IWCC 2011. Lecture Notes in Computer Science, vol 6639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20901-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20901-7_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20900-0

  • Online ISBN: 978-3-642-20901-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation