European Journal of Combinatorics
Graphic presentations of isotropic systems
Journal of Combinatorial Theory Series A
Error-correcting codes from graphs
Discrete Mathematics - Kleitman and combinatorics: a celebration
Projections of Binary Linear Codes onto Larger Fields
SIAM Journal on Discrete Mathematics
Stabilizer codes can be realized as graph codes
Quantum Information & Computation
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Quantum error correction via codes over GF(4)
IEEE Transactions on Information Theory
On the classification and enumeration of self-dual codes
Finite Fields and Their Applications
From graph states to two-graph states
Designs, Codes and Cryptography
Edge local complementation and equivalence of binary linear codes
Designs, Codes and Cryptography
Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Close Encounters with Boolean Functions of Three Different Kinds
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Interlace polynomials: Enumeration, unimodality and connections to codes
Discrete Applied Mathematics
New results on s-extremal additive codes over GF(4)
International Journal of Information and Coding Theory
Formally self-dual additive codes over F4
Journal of Symbolic Computation
Directed graph representation of half-rate additive codes over GF(4)
Designs, Codes and Cryptography
Quantum Information & Computation
The selfnegadual properties of generalised quadratic Boolean functions
Designs, Codes and Cryptography
Hi-index | 0.00 |
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.