Directed graph representation of half-rate additive codes over \(\text{GF}(4)\) (Q2430707)

An additive code over \(GF(4)\) is an additive subgroup of \(GF(4)^n\). A directed graph code is an additive \((n,2^n)\) code that has a generator matrix of the form \(C = \Gamma + \omega I\), where \(\Gamma\) is the adjacency matrix of a simple directed graph and \(I\) is the identity matrix. The authors show that given an \((n,2^n)\) additive code over \(GF(4)\) there exists a directed graph code equivalent to \(C\) except for one family of codes. They use this result to classify all additive \((n,2^n)\) codes over \(GF(4)\) up to length 7 including classifications of isodual and formally self-dual codes. New constructions of isodual circulant directed graph codes are given and used to produce new codes with high minimum distance up to length \(26\). The authors find new near-extremal formally self-dual codes of length \(11\) and \(13\) and isodual codes of length \(24\), \(25\) and \(26\) with better minimum distance than the best known self-dual codes.