Isodual and self-dual codes from graphs
-
Published:2021
Issue:1
Volume:32
Page:49-64
-
ISSN:1726-3255
-
Container-title:Algebra and Discrete Mathematics
-
language:
-
Short-container-title:ADM
Author:
Mallik S., ,Yildiz B.,
Abstract
Binary linear codes are constructed from graphs, in particular, by the generator matrix [In|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.
Publisher
State University Luhansk Taras Shevchenko National University
Subject
Discrete Mathematics and Combinatorics,Algebra and Number Theory
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A new formula for the minimum distance of an expander code;Journal of Algebra Combinatorics Discrete Structures and Applications;2022-05-05