Graph theoretic aspects of minimum distance and equivalence of binary linear codes

MaRDI QIDQ4990142zbMATH OpenFDO

Authors Sudipta Mallik, Bahattin Yildiz

Publication date 28 May 2021

Full work available at URL http://ajc.maths.uq.edu.au/pdf/79/ajc_v79_p515.pdf

zbMATH Keywords

Hamming distanceminimum distance of codes

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Linear codes (general theory) (94B05)

Recommendations

• scientific article; zbMATH DE number 975345
• The minimum distance of graph codes
• On the minimum distance graph of an extended Preparata code
• Isodual and self-dual codes from graphs
• Equivalent circulant graphs associated with a binary cyclic code

Cites work

• A characterization of graphs by codes from their incidence matrices
• Binary codes from the complements of the triangular graphs
• Codes on Graphs: Fundamentals
• Introduction to Coding Theory
• Is code equivalence easy to decide?
• Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
• Ternary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45, 12, 3) designs
• The hardness of code equivalence over F_q and its application to code-based cryptography
• The intractability of computing the minimum distance of a code
• \(LCD\) codes from adjacency matrices of graphs

Cited in

(11)

• Optimum distance flag codes from spreads via perfect matchings in graphs
• A new formula for the minimum distance of an expander code
• New distance concept and graph theory approach for certain coding techniques design and analysis
• On the Hasse diagram of binary linear codes
• Codes from incidence matrices of hypergraphs
• scientific article; zbMATH DE number 1285452 (Why is no real title available?)
• Edge local complementation and equivalence of binary linear codes
• Period-3 orbits of sequential dynamical systems and their relationship to error-correcting codes over finite fields
• On the number of minimal codewords in codes generated by the adjacency matrix of a graph
• On the minimum distance graph of an extended Preparata code
• Characterizations for minimal codes: graph theory approach and algebraic approach over finite chain rings

This page was built for publication: Graph theoretic aspects of minimum distance and equivalence of binary linear codes

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