2000 character limit reached
Additive codes over $GF(4)$ from circulant graphs (1403.7933v1)
Published 31 Mar 2014 in math.CO, cs.DM, cs.IT, and math.IT
Abstract: 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.