Isodual and self-dual codes from graphs

zbMATH Open1501.94093arXiv1908.03513MaRDI QIDQ5862397FDOQ5862397

Authors:

Publication date: 9 March 2022

Abstract: Binary linear codes are constructed from graphs, in particular, by the generator matrix $[I_n|A]$ where $A$ is the adjacency matrix of a graph on $n$ vertices. A combinatorial interpretation of the minimum distance of such codes is given. We also present graph theoretic conditions for such linear codes to be Type I and Type II self-dual. Several examples of binary linear codes produced by well-known graph classes are given.

Full work available at URL: https://arxiv.org/abs/1908.03513

Recommendations

• scientific article; zbMATH DE number 1028232
• Constructing self-dual codes using graphs
• Binary codes of strongly regular graphs
• On graphs and codes
• The neighbor graph of binary self-dual codes

zbMATH Keywords

graphsadjacency matrixstrongly regular graphsself-dual codesisodual codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Cites Work

• Chromatic number and the 2-rank of a graph
• Shadow bounds for self-dual codes
• Switched symplectic graphs and their 2-ranks
• Classes of graphs with minimum skew rank 4
• Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
• A characterization of graphs by codes from their incidence matrices
• Error-correcting codes from graphs
• Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs
• New self-dual additive \(\mathbb{F}_4\)-codes constructed from circulant graphs
• Rank-3 graphs, block designs, and codes with unequal symbol protection
• Codes on Graphs: Fundamentals
• \(LCD\) codes from adjacency matrices of graphs
• Binary codes from the complements of the triangular graphs
• Codes from embeddings of the strong product of triangular graphs and \(K_2\) and certain induced subgraphs.

Cited In (8)

• Self-dual codes defined on factor graphs
• A new formula for the minimum distance of an expander code
• Construction of self dual codes from graphs
• The neighbor graph of binary self-dual codes
• Graph theoretic aspects of minimum distance and equivalence of binary linear codes
• Constructions of binary codes based on bipartite graphs
• On graphs and codes
• Title not available (Why is that?)

This page was built for publication: Isodual and self-dual codes from graphs

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