Additive codes over GF(4) from circulant graphs
classification
🧮 math.CO
cs.DMcs.ITmath.IT
keywords
additivecodescirculantcodegraphgraphsoptimumproposed
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.