Additive codes over $GF(4)$ from circulant graphs
Ruihu Li, Xueliang Li, Yaping Mao, Meiqin Wei
TL;DR
This paper introduces a new method for discovering optimal additive codes over GF(4) using circulant graphs, building on the link between self-dual codes and graph codes established in 2006.
Contribution
The paper presents a novel approach to find optimal additive codes over GF(4) by leveraging circulant graphs, expanding the toolkit for code search.
Findings
New method for searching additive codes from circulant graphs
Potential to identify more optimal codes using graph-based techniques
Enhancement of code search efficiency and effectiveness
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Error Correcting Code Techniques