Graph theoretic aspects of minimum distance and equivalence of binary linear codes

Sudipta Mallik, Bahattin Yildiz

Research output: Contribution to journalArticlepeer-review

Abstract

A binary linear [2n, n]-code with generator matrix [In|A] can be associated with a digraph on n vertices with adjacency matrix A and vice versa. We use this connection to present a graph theoretic formula for the minimum distance of codes with information rate 1/2. We also formulate the equivalence of such codes via new transformations on corresponding digraphs.

Original languageEnglish (US)
Pages (from-to)515-526
Number of pages12
JournalAustralasian Journal of Combinatorics
Volume79
StatePublished - Feb 2021

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Graph theoretic aspects of minimum distance and equivalence of binary linear codes'. Together they form a unique fingerprint.

Cite this