Error-correcting codes from graphs

DOI10.1016/S0012-365X(02)00513-7zbMath1015.05041OpenAlexW2000056635MaRDI QIDQ1850033

Vladimir D. Tonchev

Publication date: 2 December 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00513-7

zbMATH Keywords

Gilbert-Varshamov boundlinear binary codemajority decodingquantum-error-correcting code

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Structured Codes of Graphs ⋮ On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12 ⋮ Searching for (near) Optimal Codes ⋮ GHWs of codes derived from the incidence matrices of some graphs ⋮ Isodual and Self-dual Codes from Graphs ⋮ Linear ternary codes of strongly regular signed graphs ⋮ Linear codes and cyclic codes over finite rings and their generalizations: a survey ⋮ Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs ⋮ LDPC Codes Based on Algebraic Graphs ⋮ On quantum SPC product codes ⋮ Aperiodic propagation criteria for Boolean functions ⋮ Quantum stabilizer codes, lattices, and CFTs ⋮ Quadratic residue codes, rank three groups and PBIBDs

This page was built for publication: Error-correcting codes from graphs