Discrete Isoperimetric Inequalities and the Probability of a Decoding Error

Combinatorics Probability and Computing

Volumn 9, Issue 5, 2000, Pages 465-479

  Tillich, Jean Pierre ^a   Zémor, Gilles ^b  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b TELECOM PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0442280188     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548300004466     Document Type: Article

References (17)

1. Bobkov, S. (1997) An isoperimetric inequality on the discrete cube, and an elementary proof of the isoperimetric inequality in Gauss space. Ann. Probab. 25 206-214.
2. Bobkov, S. and Goetze, F. (1996) Discrete isoperimetric and Poincaré-type inequalities. Technical report SFB 343, University of Bielefeld 96-086.
3. Bourgain, J., Kahn, J., Kalai, G., Katznelson, Y. and Linial, N. (1992) The influence of variables in product spaces. Israel J. Math. 77 55-64.
4. Bourgain, J. and Kalai, G. (1997) Influences of variables and threshold intervals under group symmetries. Geometric and Functional Analysis 7 438-461.
5. Csiszàr, I. and Körner, J. (1981) Information Theory Coding Theorems for Discrete Memoryless Systems, Academic Press.
6. Elias, P. (1956) Coding for two noisy channels. In Information Theory, Academic Press, pp. 61-74.
7. Friedgut, E. (1999) Sharp thresholds of graph properties, and the k-sat problem. Appendix of J. Bourgain, J. Amer. Math. Soc. 12 1017-1054.
8. Friedgut, E. and Kalai, G. (1996) Every monotone graph property has a sharp threshold. Proc. Amer. Math. Soc. 124 2993-3002.
9. Gallager, R. G. (1965) A simple derivation of the coding theorem and some applications. IEEE Trans. Inform. Theory 11 3-18.
10. Gallager, R. G. (1968) Information Theory and Reliable Communications, Wiley.
11. Kahn, J., Kalai, G. and Linial N. (1988) The influence of variables on Boolean functions. In Proc. 29th Ann. Symp. on Foundations of Comput. Sci., IEEE Press, pp. 68-80.
12. Margulis, G. (1974) Probabilistic characteristics of graphs with large connectivity. Problemy Peredachi Informatsii 10 101-108.
13. Russo, L. (1982) An approximative zero-one law. Zeit. Warsch. und Verwandte Gebiete 61 129-139.
14. Talagrand, M. (1993) Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis' graph connectivity theorem. Geometric and Functional Analysis 3 295-314.
15. Talagrand, M. (1997) On boundaries and influences. Combinatorica 17 275-285.
16. Talagrand, M. (1994) On Russo's approximate zero-one law. Ann. Probab. 22 1576-1587.
17. Zémor, G. (1994) Threshold effects in codes. In Algebraic Coding, Vol. 781 of Springer Lecture Notes in Computer Science, pp. 278-286.