Ruihu Li, Xueliang Li, Yaping Mao, Meiqin Wei
Published 2014-03-31Version 1
In $2006$, Danielsen and Parker \cite{DP} proved that every self-dual additive code over $GF(4)$ is equivalent to a graph code. So, graph is an important tool for searching (proposed) optimum codes. In this paper, we introduce a new method of searching (proposed) optimum additive codes from circulant graphs.
Comments: 9 pages. arXiv admin note: substantial text overlap with arXiv:1402.6399
Formally self-dual linear binary codes from circulant graphs
Asymptotic Automorphism Groups of Circulant Graphs and Digraphs
Maximum nullity and zero forcing of circulant graphs
![QR code for arXiv:1403.7933 [math.CO]](http://oss.arxitics.com/images/favicon.svg)