Additive codes over GF(4) from circulant graphs

2014/03/31 by Ruihu Li, Xueliang Li, Li, Ruihu +5
Computer Science · Engineering · #05C25 #05C50 #94B05 #Coding theory and cryptography #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #Error Correcting Code Techniques #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1403.7933

openalex publication_date 2014/03/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In 2006, Danielsen and Parker \citeDP 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.

Related

• Formally self-dual linear binary codes from circulant graphs
• Optimal bounds on codes for location in circulant graphs
• A polynomial time reduction from the multi-graph isomorphism problem to additive code equivalence
• New Qubit Codes from Multidimensional Circulant Graphs
• Improved Quantum Codes from Metacirculant Graphs via Self-Dual Additive \mathbbF₄-Codes