Additive codes over $GF(4)$ from circulant graphs

preprint2014arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Additive codes over $GF(4)$ from circulant graphs

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

Additive codes over GF(4)GF(4)GF(4) from circulant graphs

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

Additive codes over $GF(4)$ from circulant graphs