Skip to main content

An Overview of the Isoperimetric Method in Coding Theory (Extended Abstract) [Invited Paper]

  • Conference paper
  • First Online:
Cryptography and Coding (Cryptography and Coding 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1746))

Included in the following conference series:

  • 460 Accesses

Abstract

When decoding a threshold phenomenon is often observed: decoding deteriorates very suddenly around some critical value of the channel parameter. Threshold behaviour has been studied in many situations outside coding theory and a number of tools have been developped. One of those turns out to be particularly relevant to coding, namely the derivation of isoperimetric inequalities for product measures on Hamming spaces. we discuss this approach and derive consequences.

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

Access this chapter

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. Bobkov, S., Goetze, F. (1996) Discrete Isoperimetric and Poincaré-type inequalities. Technical report SFB 343 University of Bielefeld 96–086. ftp://ftp.mathematik.uni-bielefeld.de/pub/papers/sfb343/pr96086.ps.gz

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

    MathSciNet  MATH  Google Scholar 

  3. Talagrand, M. (1993) Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis’ graph connectivity theorem. Geometric and Functional Analysis. 3, 295–314.

    Article  MathSciNet  Google Scholar 

  4. Tillich, J-P., Zémor, G. (1999) Discrete inequalities and the probability of a decoding error. Submitted to Combinatorics, Probability & Computing. http://www.infres.enst.fr/zemor/isoperimetric.ps

  5. Zémor, G. (1994) Threshold effects in codes. In Algebraic coding, Springer-Verlag, LNCS 781 278–286.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tillich, JP., Zémor, G. (1999). An Overview of the Isoperimetric Method in Coding Theory (Extended Abstract) [Invited Paper]. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-46665-7_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66887-9

  • Online ISBN: 978-3-540-46665-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics