Graph Theoretic Aspects of Minimum Distance and Equivalence of Binary Linear Codes

Authors

Sudipta Mallik, Marshall UniversityFollow
Bahattin Yildiz

Document Type

Article

Publication Date

2-2021

Abstract

A binary linear [2n, n]-code with generator matrix [I_n|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.

Comments

© The Authors. Released under the CC BY-ND 4.0 International License.

Recommended Citation

Mallik, S., & Yildiz, B. (2021). Graph theoretic aspects of minimum distance and equivalence of binary linear codes. Australas. J Comb., 79, 515-526.