Isodual and Self-dual Codes from Graphs
Combinatorics
2021-01-08 v2
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.
Cite
@article{arxiv.1908.03513,
title = {Isodual and Self-dual Codes from Graphs},
author = {Sudipta Mallik and Bahattin Yildiz},
journal= {arXiv preprint arXiv:1908.03513},
year = {2021}
}