On the classification of all self-dual additive codes over GF(4) of length up to 12
From MaRDI portal
Publication:855831
Abstract: We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these codes can be represented as graphs, and that two codes are equivalent if and only if the corresponding graphs are equivalent with respect to local complementation and graph isomorphism. We use these facts to classify all codes of length up to 12, where previously only all codes of length up to 9 were known. We also classify all extremal Type II codes of length 14. Finally, we find that the smallest Type I and Type II codes with trivial automorphism group have length 9 and 12, respectively.
Recommendations
- Some new results for additive self-dual codes over \(\mathrm{GF}(4)\)
- The classification of self-dual codes over Galois rings of length 4
- Formally self-dual additive codes over \(\mathbb F_4\)
- Circulant Based Extremal Additive Self-Dual Codes Over>tex<$hboxGF,(4)$>/tex<
- Additive self-dual codes over \(\mathbb F_4\) with an automorphism of odd prime order
- Self-dual additive \(\mathbb{F}_4\)-codes of lengths up to 40 represented by circulant graphs
- Classification of self-dual codes of length 20 over \(\mathbb{Z}_4\) and length at most 18 over \(\mathbb{F}_2+u\mathbb{F}_2\)
- \(\mathbb Z_2\mathbb Z_4\)-additive formally self-dual codes
- Extremal type I additive self-dual codes over \(\mathrm{GF}(4)\) with near-minimal shadow
- Self-dual codes over \(\mathbb{Z}_{4} + w\mathbb{Z}_{4}\)
Cites work
- Error-correcting codes from graphs
- Graphic presentations of isotropic systems
- scientific article; zbMATH DE number 1284416 (Why is no real title available?)
- scientific article; zbMATH DE number 758277 (Why is no real title available?)
- Isotropic systems
- Local unitary versus local Clifford equivalence of stabilizer states
- Multiparty entanglement in graph states
- On additive GF(4) codes
- On extremal additive \({\mathbb{F}}_4\) codes of length 10 to 18
- On the classification and enumeration of self-dual codes
- Projections of Binary Linear Codes onto Larger Fields
- Quantum error correction via codes over GF(4)
- Self-dual codes over the Kleinian four group
- Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I,H,N} n Transform
- Stabilizer codes can be realized as graph codes
- The On-Line Encyclopedia of Integer Sequences
Cited in
(36)- From graph states to two-graph states
- Edge local complementation and equivalence of binary linear codes
- New quantum codes constructed from some self-dual additive \(\mathbb F_4\)-codes
- The selfnegadual properties of generalized quadratic Boolean functions
- Efficient entanglement measure for graph states
- Quantum stabilizer codes, lattices, and CFTs
- Two new zero-dimensional qubit codes from bordered metacirculant construction
- Additive Toeplitz codes over \(\mathbb{F}_4\)
- On graphs and codes preserved by edge local complementation
- Graph-based classification of self-dual additive codes over finite fields
- Self-dual additive \(\mathbb{F}_4\)-codes of lengths up to 40 represented by circulant graphs
- Directed graph representation of half-rate additive codes over \(\text{GF}(4)\)
- Additive self-dual codes over \(\mathbb F_4\) with an automorphism of odd prime order
- On additive GF(4) codes
- Some Ulam's reconstruction problems for quantum states
- Searching for (near) optimal codes
- Some new results for additive self-dual codes over \(\mathrm{GF}(4)\)
- Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
- Close Encounters with Boolean Functions of Three Different Kinds
- Circulant Based Extremal Additive Self-Dual Codes Over>tex<$hboxGF,(4)$>/tex<
- Codeword stabilized quantum codes: algorithm and structure
- Counting single-qubit Clifford equivalent graph states is \#\(\mathbb{P}\)-complete
- New lower bounds for the number of ACG codes over \(\mathbb{F}_4\)
- A projection decoding of a binary extremal self-dual code of length 40
- Exclusivity structures and graph representatives of local complementation orbits
- Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I,H,N} n Transform
- Classification of Self-Orthogonal Codes over \boldmath$\F_3$ and \boldmath$\F_4$
- On the classification and enumeration of self-dual codes
- New quantum codes from metacirculant graphs via self-dual additive \(\mathbb{F}_4\)-codes
- On construction of ternary optimal self-orthogonal codes
- Additive conjucyclic codes over a class of Galois rings
- On Eisenstein additive codes over chain rings and linear codes over mixed alphabets
- Griesmer type bounds for additive codes over finite fields, integral and fractional MDS codes
- New self-dual additive \(\mathbb{F}_4\)-codes constructed from circulant graphs
- Interlace polynomials: enumeration, unimodality and connections to codes
- Formally self-dual additive codes over \(\mathbb F_4\)
This page was built for publication: On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855831)
