Graph-based classification of self-dual additive codes over finite fields
From MaRDI portal
Abstract: Quantum stabilizer states over GF(m) can be represented as self-dual additive codes over GF(m^2). These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to equivalence classes of codes. We have previously used this fact to classify self-dual additive codes over GF(4). In this paper we classify self-dual additive codes over GF(9), GF(16), and GF(25). Assuming that the classical MDS conjecture holds, we are able to classify all self-dual additive MDS codes over GF(9) by using an extension technique. We prove that the minimum distance of a self-dual additive code is related to the minimum vertex degree in the associated graph orbit. Circulant graph codes are introduced, and a computer search reveals that this set contains many strong codes. We show that some of these codes have highly regular graph representations.
Recommendations
- On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
- Self-dual additive \(\mathbb{F}_4\)-codes of lengths up to 40 represented by circulant graphs
- New self-dual additive \(\mathbb{F}_4\)-codes constructed from circulant graphs
- Two new zero-dimensional qubit codes from bordered metacirculant construction
- Some new results for additive self-dual codes over \(\mathrm{GF}(4)\)
Cited in
(14)- Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless
- Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I,H,N} n Transform
- Constacyclic \(\mathbb F_q\)-linear codes over \(\mathbb F_{q^l}\)
- Searching for (near) optimal codes
- Enumeration and construction of additive cyclic codes over Galois rings
- Two new zero-dimensional qubit codes from bordered metacirculant construction
- Repeated root cyclic \(\mathbb{F}_q\)-linear codes over \(\mathbb{F}_{q^l}\)
- Self-dual additive \(\mathbb{F}_4\)-codes of lengths up to 40 represented by circulant graphs
- New lower bounds for the number of ACG codes over \(\mathbb{F}_4\)
- Interlace polynomials: enumeration, unimodality and connections to codes
- Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
- Semisimple multivariable \(\mathbb {F}_q\)-linear codes over \(\mathbb {F}_{q^l}\)
- Directed graph representation of half-rate additive codes over \(\text{GF}(4)\)
- Generalized graph states based on Hadamard matrices
This page was built for publication: Graph-based classification of self-dual additive codes over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268667)
