Additive codes over from circulant graphs
arXiv:1403.7933
Abstract
In , Danielsen and Parker \cite{DP} proved that every self-dual additive code over 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.
9 pages. arXiv admin note: substantial text overlap with arXiv:1402.6399