On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12

DOI10.1016/j.jcta.2005.12.004zbMath1105.94017arXivmath/0504522OpenAlexW2123849728MaRDI QIDQ855831

Matthew G. Parker, Lars Eirik Danielsen

Publication date: 7 December 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0504522

zbMATH Keywords

graphsself-dual codeslocal complementation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05) Quantum computation (81P68) Combinatorial codes (94B25)

Related Items (25)

Searching for (near) Optimal Codes ⋮ New quantum codes constructed from some self-dual additive \(\mathbb F_4\)-codes ⋮ Additive Toeplitz codes over \(\mathbb{F}_4\) ⋮ Self-dual additive \(\mathbb{F}_4\)-codes of lengths up to 40 represented by circulant graphs ⋮ The selfnegadual properties of generalized quadratic Boolean functions ⋮ New quantum codes from metacirculant graphs via self-dual additive \(\mathbb{F}_4\)-codes ⋮ Counting single-qubit Clifford equivalent graph states is #P-complete ⋮ Directed graph representation of half-rate additive codes over \(\text{GF}(4)\) ⋮ Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation ⋮ Close Encounters with Boolean Functions of Three Different Kinds ⋮ Exclusivity structures and graph representatives of local complementation orbits ⋮ A projection decoding of a binary extremal self-dual code of length 40 ⋮ Interlace polynomials: enumeration, unimodality and connections to codes ⋮ On graphs and codes preserved by edge local complementation ⋮ Efficient entanglement measure for graph states ⋮ Formally self-dual additive codes over \(\mathbb F_4\) ⋮ On the classification and enumeration of self-dual codes ⋮ Quantum stabilizer codes, lattices, and CFTs ⋮ New self-dual additive \(\mathbb{F}_4\)-codes constructed from circulant graphs ⋮ Two new zero-dimensional qubit codes from bordered metacirculant construction ⋮ From graph states to two-graph states ⋮ Edge local complementation and equivalence of binary linear codes ⋮ Unnamed Item ⋮ Codeword stabilized quantum codes: Algorithm and structure ⋮ Some Ulam’s reconstruction problems for quantum states

Uses Software

• Magma
• nauty
• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isotropic systems
• Graphic presentations of isotropic systems
• Self-dual codes over the Kleinian four group
• Error-correcting codes from graphs
• Local unitary versus local Clifford equivalence of stabilizer states
• Multiparty entanglement in graph states
• Projections of Binary Linear Codes onto Larger Fields
• Quantum error correction via codes over GF(4)
• Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I,H,N} n Transform
• On the classification and enumeration of self-dual codes
• On extremal additive \({\mathbb{F}}_4\) codes of length 10 to 18

This page was built for publication: On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12