Isodual and self-dual codes from graphs

• Published in: Algebra and Discrete Mathematics
• Date: 2021
• Main Authors: Mallik, S., Yildiz, B.
• Format: Article
• Language: English
• Published: Інститут прикладної математики і механіки НАН України 2021
• Online Access: https://nasplib.isofts.kiev.ua/handle/123456789/188717
• Journal Title: Digital Library of Periodicals of National Academy of Sciences of Ukraine
• Cite this: Isodual and self-dual codes from graphs / S. Mallik, B. Yildiz // Algebra and Discrete Mathematics. — 2021. — Vol. 32, № 1. — С. 49–64. — Бібліогр.: 15 назв. — англ.

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...