19 citations · 45 across the 3 of their papers we have counts for
6 papers
Graph-Based Classification of Self-Dual Additive Codes over Finite Fields
Lars Eirik Danielsen
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…
Edge Local Complementation and Equivalence of Binary Linear Codes
Lars Eirik Danielsen, Matthew G. Parker
Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of a binary…
On Pivot Orbits of Boolean Functions
Constanza Riera, Lars Eirik Danielsen, Matthew G. Parker
We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boo…
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with respect to the {I,H,N}^n Transform
Lars Eirik Danielsen, Matthew G. Parker
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =…
On the Classification of All Self-Dual Additive Codes over GF(4) of Length up to 12
Lars Eirik Danielsen, Matthew G. Parker
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 corresp…
On Self-Dual Quantum Codes, Graphs, and Boolean Functions
Lars Eirik Danielsen
A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as…