Non-existence of perfect binary sequences
Abstract
Binary sequences with lower autocorrelation values have important applications in cryptography and communications. In this paper, we present all possible parameters for binary periodical sequences with a 2-level autocorrelation values. For n 1 4, we prove some cases of Schmidt's Conjecture for perfect binary sequences. (Des. Codes Cryptogr. 78 (2016), 237-267.) For n 2 4, Jungnickel and Pott (Discrete Appl. Math. 95 (1999) 331-359.) left four perfect binary sequences as open problem and we solve three of its. For n 3 4, we present some nonexistence of binary sequences which all nontrivial autocorrelation values are equal 3. For n 0 4, we show that there do not exist the binary sequences which all nontrivial autocorrelation values are equal 4.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.