European Journal of Combinatorics
Determination of the merit factor of Legendre sequences
IEEE Transactions on Information Theory
The L4 norm of a polynomial with coefficients
American Mathematical Monthly
Recognizing locally equivalent graphs
Discrete Mathematics - Special issue on combinatorics and algorithms
Quantum computation and quantum information
Quantum computation and quantum information
Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
The interlace polynomial of a graph
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Aperiodic propagation criteria for Boolean functions
Information and Computation
A survey of the merit factor problem for binary sequences
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
A new search for optimal binary arrays with minimum peak sidelobe levels
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
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
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
Binary sequences with merit factor greater than 6.34
IEEE Transactions on Information Theory
Binary sequences with merit factor 6.3
IEEE Transactions on Information Theory
Generalized Bent Criteria for Boolean Functions (I)
IEEE Transactions on Information Theory
Aperiodic propagation criteria for Boolean functions
Information and Computation
From graph states to two-graph states
Designs, Codes and Cryptography
Close Encounters with Boolean Functions of Three Different Kinds
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Aperiodic propagation criteria for Boolean functions
Information and Computation
Interlace polynomials: Enumeration, unimodality and connections to codes
Discrete Applied Mathematics
The perfect binary sequence of period 4 for low periodic and aperiodic autocorrelations
SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
One and two-variable interlace polynomials: a spectral interpretation
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Advances in the merit factor problem for binary sequences
Journal of Combinatorial Theory Series A
| Hi-index | 0.00 |
Merit factor of a binary sequence is reviewed, and constructions are described that appear to satisfy an asymptotic merit factor of 6.3421... Multivariate merit factor is characterised and recursive Boolean constructions are presented which satisfy a non-vanishing asymptote in multivariate merit factor. Clifford merit factor is characterised as a generalisation of multivariate merit factor and as a type of quantum merit factor. Recursive Boolean constructions are presented which, however, only satisfy an asymptotic Clifford merit factor of zero. It is demonstrated that Boolean functions obtained via quantum error correcting codes tend to maximise Clifford merit factor. Results are presented as to the distribution of the above merit factors over the set of binary sequences and Boolean functions.