preprint · ArXiv.org · 2007
Periodic complementary sets of binary sequences
Cited by 5Open access
Abstract
Let PCS_p^N denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a delta-function. In the 1990, Boemer and Antweiler addressed the problem of constructing such sequences. They presented a table covering the range p <= 12, N <= 50 and showing in which cases it was known at that time whether such sequences exist, do not exist, or the question of existence is undecided. The number of undecided cases was rather large. Subsequently the number of undecided cases was reduced to 26 by the author. In the present note, several cyclic difference families are constructed and used to obtain new sets of periodic binary sequences. Thereby the original problem of Boemer and Antweiler is completely solved.
Cite this paper
Djoković, D. Ž. (2007). Periodic complementary sets of binary sequences. ArXiv.org. https://doi.org/10.48550/arxiv.0708.0053
Djoković, Dragomir Ž. “Periodic complementary sets of binary sequences.” ArXiv.org, 2007, https://doi.org/10.48550/arxiv.0708.0053.
Djoković, Dragomir Ž. 2007. “Periodic complementary sets of binary sequences.” ArXiv.org. https://doi.org/10.48550/arxiv.0708.0053.
Djoković, D.Ž. (2007) ‘Periodic complementary sets of binary sequences’, ArXiv.org. Available at: https://doi.org/10.48550/arxiv.0708.0053.
@misc{djokovic2007periodic,
title = {{Periodic complementary sets of binary sequences}},
author = {Djoković, Dragomir Ž.},
journal = {ArXiv.org},
year = {2007},
doi = {10.48550/arxiv.0708.0053}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.