The Minimum Distance of Graph Codes

DOI10.1007/978-3-642-20901-7_12zbMath1271.05096OpenAlexW69972012MaRDI QIDQ3005590

Tom Høholdt, Jørn Justesen

Publication date: 8 June 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/42cfa0c3-e07b-4b91-98b0-0f05be829119

zbMATH Keywords

projective geometryEuclidean geometrybipartite expander graphsgraph codes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Applications of graph theory to circuits and networks (94C15) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (3)

Efficient proofs of retrievability using expander codes ⋮ On the sizes of expander graphs and minimum distances of graph codes ⋮ Optimal codes as Tanner codes with cyclic component codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized polygons
• On Tanner codes: Minimum distance and decoding
• The nonexistence of certain generalized polygons
• Expander codes
• Explicit Concentrators from Generalized N-Gons
• Algebraic Codes on Lines, Planes, and Curves
• Improved Nearly-MDS Expander Codes
• A recursive approach to low complexity codes
• Minimum-distance bounds by graph analysis
• On expander codes
• Error exponents of expander codes
• Introduction to Coding Theory

This page was built for publication: The Minimum Distance of Graph Codes