Ruihu Li, Xueliang Li, Yaping Mao, Meiqin Wei
Published 2014-02-26, updated 2014-03-31Version 3
In 2002, Tonchev first constructed some linear binary codes defined by the adjacency matrices of undirected graphs. So, graph is an important tool for searching optimum codes. In this paper, we introduce a new method of searching (proposed) optimum formally self-dual linear binary codes from circulant graphs.
Additive codes over $GF(4)$ from circulant graphs
Asymptotic Automorphism Groups of Circulant Graphs and Digraphs
Maximum nullity and zero forcing of circulant graphs
![QR code for arXiv:1402.6399 [math.CO]](http://oss.arxitics.com/images/favicon.svg)