Minimum-distance bounds by graph analysis

DOI10.1109/18.910591zbMath1002.94034OpenAlexW2149231487MaRDI QIDQ4544523

R. Michael Tanner

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b467ba3c3d8d22c34667c1006a7e09e71cfe1bbf

zbMATH Keywords

linear programmingeigenvaluesblock codesTanner graphminimum distance boundcode graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear programming (90C05) Linear codes (general theory) (94B05) Combinatorial optimization (90C27) Bounds on codes (94B65)

Related Items (7)

Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles ⋮ Regular LDPC codes from semipartial geometries ⋮ The Minimum Distance of Graph Codes ⋮ Eigenvalues and expansion of bipartite graphs ⋮ On codewords in the dual code of classical generalised quadrangles and classical polar spaces ⋮ Small weight codewords in the LDPC codes arising from linear representations of geometries ⋮ LDPC codes constructed from cubic symmetric graphs

This page was built for publication: Minimum-distance bounds by graph analysis