European Journal of Combinatorics
Recognizing locally equivalent graphs
Discrete Mathematics - Special issue on combinatorics and algorithms
The interlace polynomial of a graph
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
The On-Line Encyclopedia of Integer Sequences
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Aperiodic propagation criteria for Boolean functions
Information and Computation
Quantum error correction via codes over GF(4)
IEEE Transactions on Information Theory
Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes
IEEE Transactions on Information Theory
Circulant based extremal additive self-dual codes over GF(4)
IEEE Transactions on Information Theory
Aperiodic propagation criteria for Boolean functions
Information and Computation
On the classification of all self-dual additive codes over GF(4) of length up to 12
Journal of Combinatorial Theory Series A
From graph states to two-graph states
Designs, Codes and Cryptography
Edge local complementation and equivalence of binary linear codes
Designs, Codes and Cryptography
Aperiodic propagation criteria for Boolean functions
Information and Computation
Interlace polynomials: Enumeration, unimodality and connections to codes
Discrete Applied Mathematics
One and two-variable interlace polynomials: a spectral interpretation
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Univariate and multivariate merit factors
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
The selfnegadual properties of generalised quadratic Boolean functions
Designs, Codes and Cryptography
Hi-index | 0.00 |
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 = 9 to n = 12. These codes have a well-known interpretation as quantum codes. They can also be represented by graphs, where a simple graph operation generates the orbits of equivalent codes. We highlight the regularity and structure of some graphs that correspond to codes with high distance. The codes can also be interpreted as quadratic Boolean functions, where inequivalence takes on a spectral meaning. In this context we define PARIHN, peak-to-average power ratio with respect to the {I,H,N}n transform set. We prove that PARIHN of a Boolean function is equivalent to the the size of the maximum independent set over the associated orbit of graphs. Finally we propose a construction technique to generate Boolean functions with low PARIHN and algebraic degree higher than 2.