The minimum distance of graph codes

DOI10.1007/978-3-642-20901-7_12MaRDI QIDQ3005590zbMATH OpenOpenAlexFDO

Authors 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

bipartite expander graphsEuclidean geometrygraph codesprojective geometry

Mathematics Subject Classification ID

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

Recommendations

• On the sizes of expander graphs and minimum distances of graph codes
• Distance properties of expander codes
• Codes from Expander Graphs
• A new formula for the minimum distance of an expander code
• Bounds on the minimum code distance for nonbinary codes based on bipartite graphs

Cites work

• A recursive approach to low complexity codes
• Algebraic Codes on Lines, Planes, and Curves
• Error exponents of expander codes
• Expander codes
• Explicit Concentrators from Generalized N-Gons
• Generalized polygons
• scientific article; zbMATH DE number 3499621 (Why is no real title available?)
• scientific article; zbMATH DE number 2043978 (Why is no real title available?)
• scientific article; zbMATH DE number 1849959 (Why is no real title available?)
• Improved Nearly-MDS Expander Codes
• Introduction to Coding Theory
• Minimum-distance bounds by graph analysis
• On expander codes
• On Tanner codes: Minimum distance and decoding
• The nonexistence of certain generalized polygons

Cited in

(15)

• On the number of minimal codewords in codes generated by the adjacency matrix of a graph
• New distance concept and graph theory approach for certain coding techniques design and analysis
• The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
• Optimal codes as Tanner codes with cyclic component codes
• On the sizes of expander graphs and minimum distances of graph codes
• On the minimum distance graph of an extended Preparata code
• Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
• scientific article; zbMATH DE number 1285452 (Why is no real title available?)
• Codes on planar Tanner graphs
• On the dimension of a class of graph codes on algebraically defined graphs with Reed-Solomon component codes
• Graph theoretic aspects of minimum distance and equivalence of binary linear codes
• A new formula for the minimum distance of an expander code
• A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
• Efficient proofs of retrievability using expander codes
• Optimum distance flag codes from spreads via perfect matchings in graphs

This page was built for publication: The minimum distance of graph codes

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