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 probability; Ramanujan graph; cycle code

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

11Z05: Miscellaneous applications of number theory

94B25: Combinatorial codes

94B70: Error probability in coding theory

94A24: Coding theorems (Shannon theory)

Related Items

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