On the classification of all self-dual additive codes over GF(4) of length up to 12
From MaRDI portal
Publication:855831
DOI10.1016/J.JCTA.2005.12.004zbMATH Open1105.94017arXivmath/0504522OpenAlexW2123849728MaRDI QIDQ855831FDOQ855831
Authors: Lars Eirik Danielsen, Matthew G. Parker 
Publication date: 7 December 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math/0504522
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}\)
Applications of graph theory (05C90) Quantum computation (81P68) Linear codes (general theory) (94B05) Combinatorial codes (94B25)
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum error correction via codes over GF(4)
- On the classification and enumeration of self-dual codes
- Multiparty entanglement in graph states
- Graphic presentations of isotropic systems
- Isotropic systems
- Error-correcting codes from graphs
- Self-dual codes over the Kleinian four group
- On additive GF(4) codes
- Projections of Binary Linear Codes onto Larger Fields
- On extremal additive \({\mathbb{F}}_4\) codes of length 10 to 18
- Local unitary versus local Clifford equivalence of stabilizer states
- Stabilizer codes can be realized as graph codes
- Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I,H,N} n Transform
Cited In (34)
- Graph-based classification of self-dual additive codes over finite fields
- Additive conjucyclic codes over a class of Galois rings
- 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
- Efficient entanglement measure for graph states
- Quantum stabilizer codes, lattices, and CFTs
- Formally self-dual additive codes over \(\mathbb F_4\)
- Edge local complementation and equivalence of binary linear codes
- New quantum codes from metacirculant graphs via self-dual additive \(\mathbb{F}_4\)-codes
- Some Ulam's reconstruction problems for quantum states
- New self-dual additive \(\mathbb{F}_4\)-codes constructed from circulant graphs
- Some new results for additive self-dual codes over \(\mathrm{GF}(4)\)
- Searching for (near) optimal codes
- On additive GF(4) codes
- Additive Toeplitz codes over \(\mathbb{F}_4\)
- From graph states to two-graph states
- Two new zero-dimensional qubit codes from bordered metacirculant construction
- New quantum codes constructed from some self-dual additive \(\mathbb F_4\)-codes
- Counting single-qubit Clifford equivalent graph states is \#\(\mathbb{P}\)-complete
- Close Encounters with Boolean Functions of Three Different Kinds
- Self-dual additive \(\mathbb{F}_4\)-codes of lengths up to 40 represented by circulant graphs
- Additive self-dual codes over \(\mathbb F_4\) with an automorphism of odd prime order
- Codeword stabilized quantum codes: algorithm and structure
- Exclusivity structures and graph representatives of local complementation orbits
- Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
- New lower bounds for the number of ACG codes over \(\mathbb{F}_4\)
- On graphs and codes preserved by edge local complementation
- Interlace polynomials: enumeration, unimodality and connections to codes
- Circulant Based Extremal Additive Self-Dual Codes Over>tex<$hboxGF,(4)$>/tex<
- The selfnegadual properties of generalized quadratic Boolean functions
- Directed graph representation of half-rate additive codes over \(\text{GF}(4)\)
- On construction of ternary optimal self-orthogonal codes
- A projection decoding of a binary extremal self-dual code of length 40
Uses Software
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)
