Isodual and self-dual codes from graphs

S. Mallik, B. Yildiz

Research output: Contribution to journalArticlepeer-review

Abstract

Binary linear codes are constructed from graphs, in particular, by the generator matrix[In|A] whereAis 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.

Original languageEnglish (US)
Pages (from-to)49-64
Number of pages16
JournalAlgebra and Discrete Mathematics
Volume32
Issue number1
DOIs
StatePublished - 2021

Keywords

  • Adjacency matrix
  • Graphs
  • Isodual codes
  • Self-dual codes
  • Strongly regular graphs

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Isodual and self-dual codes from graphs'. Together they form a unique fingerprint.

Cite this