On the Error-Correcting Capabilities of Cycle Codes of Graphs

Combinatorics Probability and Computing

Volumn 6, Issue 1, 1997, Pages 27-38

  Decreusefond, Laurent ^a   Zémor, Gilles ^a  

^a TELECOM PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0642302405     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548396002878     Document Type: Article

References (8)

1. Berge, C. (1970) Graphes et hypergraphes. Dunod.
2. Dellacherie, C. and Meyer, P. A. (1980) Probabilités et Potentiel, Tome II. Hermann.
3. Hakimi, S. L. and Bredeson, J. G. (1968) Graph theoretic error-correcting codes. IEEE Trans. Inf. Theory IT-14 584-591.
4. Lyons, R. (1990) Random walks and percolation on trees. Annals of Probability 18 931-958.
5. Margulis, G. (1974) Probabilistic characteristics of graphs with large connectivity. Problemy Peredachi Informatsii 10 101-108.
6. Neveu, J. (1972) Martingales à Temps Discret. Masson.
7. Tillich, J.-P. and Zémor, G. Optimal cycle codes constructed from Ramanujan graphs. SIAM J. on Discrete Math. To appear.
8. Zémor, G. (1994) Threshold effects in codes. In Algebraic Coding: Lecture Notes in Computer Science 781. Springer-Verlag, pp. 278-286.