On the Error-Correcting Capabilities of Cycle Codes of Graphs

DOI10.1017/S0963548396002878zbMath0943.94016MaRDI QIDQ3123107

Gilles Zémor, Laurent Decreusefond

Publication date: 10 September 2000

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

upper boundcritical probabilitiesfractional percolation\(\delta\)-regular graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Cyclic codes (94B15)

Related Items (3)

On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction ⋮ On the Probability that a Random Subgraph Contains a Circuit ⋮ The highly connected matroids in minor-closed classes

This page was built for publication: On the Error-Correcting Capabilities of Cycle Codes of Graphs