Isodual and self-dual codes from graphs
From MaRDI portal
Publication:5862397
Abstract: Binary linear codes are constructed from graphs, in particular, by the generator matrix where is the adjacency matrix of a graph on 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.
Recommendations
Cites work
- A characterization of graphs by codes from their incidence matrices
- Binary codes from the complements of the triangular graphs
- Chromatic number and the 2-rank of a graph
- Classes of graphs with minimum skew rank 4
- Codes from embeddings of the strong product of triangular graphs and \(K_2\) and certain induced subgraphs.
- Codes on Graphs: Fundamentals
- Error-correcting codes from graphs
- New self-dual additive \(\mathbb{F}_4\)-codes constructed from circulant graphs
- Rank-3 graphs, block designs, and codes with unequal symbol protection
- Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
- Shadow bounds for self-dual codes
- Switched symplectic graphs and their 2-ranks
- Ternary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45, 12, 3) designs
- \(LCD\) codes from adjacency matrices of graphs
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
- scientific article; zbMATH DE number 750223 (Why is no real title available?)
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)
