Optimal Cycle Codes Constructed From Ramanujan Graphs

DOI10.1137/S0895480195292065zbMath0884.05048MaRDI QIDQ4377442

Gilles Zémor, Jean-Pierre Tillich

Publication date: 9 February 1998

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

error probabilityRamanujan graphcycle code

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Miscellaneous applications of number theory (11Z05) Combinatorial codes (94B25) Error probability in coding theory (94B70) Coding theorems (Shannon theory) (94A24)

Related Items

On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction