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 language||English (US)|
|Number of pages||12|
|Journal||Australasian Journal of Combinatorics|
|State||Published - Feb 2021|
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics