|
This article is cited in 1 scientific paper (total in 1 paper)
RESEARCH ARTICLE
Isodual and self-dual codes from graphs
S. Mallik, B. Yildiz Department of Mathematics and Statistics, Northern Arizona University, 801 S. Osborne Dr. PO Box: 5717, Flagstaff, AZ 86011, USA
Abstract:
Binary linear codes are constructed from graphs, in particular, by the generator matrix $[I_n\mid 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.
Keywords:
self-dual codes, isodual codes, graphs, adjacency matrix, strongly regular graphs.
Received: 17.06.2020 Revised: 24.02.2021
Citation:
S. Mallik, B. Yildiz, “Isodual and self-dual codes from graphs”, Algebra Discrete Math., 32:1 (2021), 49–64
Linking options:
https://www.mathnet.ru/eng/adm806 https://www.mathnet.ru/eng/adm/v32/i1/p49
|
Statistics & downloads: |
Abstract page: | 38 | Full-text PDF : | 29 | References: | 11 |
|