Compression of periodic complementary sequences and applications

DOI10.1007/s10623-013-9862-zzbMath1307.05033arXiv1302.0571OpenAlexW2047782372MaRDI QIDQ2256101

Dragomir Ž. Djoković, Ilias S. Kotsireas

Publication date: 19 February 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

binary sequencespower spectral densitysupplementary difference setsperiodic autocorrelation

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30)

Related Items

New nonexistence results on circulant weighing matrices, Combining SAT solvers with computer algebra systems to verify combinatorial conjectures, Constructing self-orthogonal and Hermitian self-orthogonal codes via weighing matrices and orbit matrices, Periodic Golay Pairs of Length 72, Symmetric Hadamard matrices of order 116 and 172 exist, Autocorrelation via Runs, Legendre pairs of lengths \(\ell \equiv 0 \pmod 5\), A feasibility approach for constructing combinatorial designs of circulant type, A Legendre pair of length 77 using complementary binary matrices with fixed marginals, The SAT+CAS method for combinatorial search with applications to best matrices, Computational methods for difference families in finite abelian groups, Generalizing pairs of complementary sequences and a construction of combinatorial structures, Applying computer algebra systems with SAT solvers to the Williamson conjecture, MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures, Hard satisfiable 3-SAT instances via autocorrelation, Charm bracelets and their application to the construction of periodic Golay pairs, Periodic Golay pairs and pairwise balanced designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclic \((v;r,s;\lambda)\) difference families with two base blocks and \(v \leq 50\)
• A \(D\)-optimal design of order 102
• On the existence of periodic complementary binary sequences
• The non-equivalent circulant \(D\)-optimal designs for \(n\equiv 2\bmod 4\), \(n\leqslant 54\), \(n=66\)
• Note on periodic complementary sets of binary sequences
• A fast algorithm to generate necklaces with fixed content
• Cyclic difference sets
• Generating Bracelets in Constant Amortized Time
• New Results on D-Optimal Matrices
• Combinatorial Designs
• Existence question for difference families and construction of some new families
• On Hadamard Matrices Constructible by Circulant Submatrices