On the Error-Correcting Capabilities of Cycle Codes of Graphs

DOI10.1017/S0963548396002878MaRDI QIDQ3123107zbMATH OpenFDO

Authors Gilles Zémor, Laurent Decreusefond

Publication date 10 September 2000

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

Full work available at URL https://doi.org/10.1017/S0963548396002878

zbMATH Keywords

\(\delta\)-regular graphcritical probabilitiesfractional percolationupper bound

Mathematics Subject Classification ID

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

Recommendations

• Optimal Cycle Codes Constructed From Ramanujan Graphs
• On Congruent Domination Number of Disjoint and One Point Union of Graphs
• scientific article; zbMATH DE number 1714662
• scientific article; zbMATH DE number 4210053

Cited in

(8)

• Error-correcting codes from graphs
• Detecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysis
• The highly connected matroids in minor-closed classes
• The Maximum-Likelihood Decoding Threshold for Cycle Codes of Graphs
• Flips in graphs
• On the probability that a random subgraph contains a circuit
• Double and Triple Node-Erasure-Correcting Codes Over Complete Graphs
• On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3123107)