Skip to main content
SpringerLink
Log in

On Iterative Decoding of Cycle Codes of Graphs

  • Conference paper
Codes, Systems, and Graphical Models

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 123))

Abstract

We analyze iterative decoding of cycle codes of graphs for the erasure channel and the binary symmetric channel. Cycle codes can achieve vanishing error-probability after decoding: furthermore, threshold probabilities can be computed exactly. We also prove that, for these codes, the asymptotical performance of iterative decoding and maximum-likelihood decoding coincide.

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. L. Decreusefond and G. ZÉmor, On the Error-Correcting Capabilities of Cycle Codes of Graphs, Combinatorics, Probability and Computing (1997), 6, 27–38.

    Article  MathSciNet  MATH  Google Scholar 

  2. P. Erdos and H. Sachs, Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl, Wiss. Z. Univ. Halle-Wittenberg, Math.-Nat. (1963), 12, 251–258.

    Google Scholar 

  3. R.G. Gallager, Low-density parity-check codes, M.I.T. Press, 1963.

    Google Scholar 

  4. M.R. Garey, D.S. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems, Theor. Comput. Sci. (1976), 1, 237–267.

    Article  MathSciNet  MATH  Google Scholar 

  5. G. Grimmet, Percolation, Springer-Verlag, 1989.

    Google Scholar 

  6. S.L. Hamkimi and J.G. Bredeson, Graph theoretic error-correcting codes, IEEE Trans. on Inf. Theory (1968) IT-14, 584–591.

    Article  Google Scholar 

  7. H. Kesten, The critical probability of bond percolation on the square lattice equals 1/2, Communications in Mathematical Physics (1980), 74, 41–59.

    Article  MathSciNet  MATH  Google Scholar 

  8. A. Lubotsky and R. Philips and P. Sarnack, Ramanujan graphs, Combinatorica (1988), 8, 261–277.

    Article  MathSciNet  Google Scholar 

  9. R. Lyons, Random walks and percolation on trees, The annals of probability (1990), 18(3), 931–958.

    Article  MathSciNet  MATH  Google Scholar 

  10. G.A. Margulis, Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators, Problemy Peredachi Informatsii (1988), 24, 51–60.

    MathSciNet  Google Scholar 

  11. G.A. Margulis, Probabilistic characteristics of graphs with large connectivity, Problemy Peredachi Informatsii (1974), 10, 101–108

    MathSciNet  MATH  Google Scholar 

  12. M. Tanner, A recursive approach to Low-complexity codes, IEEE Trans. on Inf. Theory (1981) IT-27, No.5, 533–547.

    Article  MathSciNet  Google Scholar 

  13. J-P. Tillich and G. ZÉmor, Optimal cycle codes constructed from Ramanujan graphs, Siam Journal on Discrete Math. (1997), 10(3), 447–459.

    MATH  Google Scholar 

  14. J-P Tillich and G. ZÉmor, Isoperimetric inequalities and the probability of a decoding error, to appear in Combinatorics, Probability & Computing.

    Google Scholar 

  15. N. Wiberg, Codes and decoding on general graphs, Ph.D. Thesis, Linköping, Sweden, 1996.

    Google Scholar 

  16. G. ZÉmor, Threshold effects in codes, in First French-Israeli workshop on algebraic coding, 1993 Lecture notes in Comput. Sci. 781, Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Network Dept, École Nationale Superieure des Telecommunications, 75634, Paris, France

    Gilles ZÉmor

Authors
  1. Gilles ZÉmor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBM Almaden Research Center, K65-802, 650 Harry Rd., San Jose, CA, 95120, USA

    Brian Marcus

  2. Department of Mathematics, University of Notre Dame, NotreDame, IN, 46556-5683, USA

    Joachim Rosenthal

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag New York, Inc.

About this paper

Cite this paper

ZÉmor, G. (2001). On Iterative Decoding of Cycle Codes of Graphs. In: Marcus, B., Rosenthal, J. (eds) Codes, Systems, and Graphical Models. The IMA Volumes in Mathematics and its Applications, vol 123. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0165-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0165-3_17

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-95173-7

  • Online ISBN: 978-1-4613-0165-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation