scientific article; zbMATH DE number 2154139
From MaRDI portal
Publication:4664692
Two binary sequences \(A=a_1 a_2\dots a_n\) and \(B=b_1 b_2\dots b_n\) are called a pair of complementary sequences if \[ R_{A}(t)+R_{B}(t)= \begin{cases} 2n, & t=0; \\ 0, & t > 0, \end{cases} \] where \(R_{A}(t)=\sum ^{n-t}_{i=1}(-1)^{a_i+a_{i+t}}\). A new algorithm is presented for verifying whether a given sequence is an element of a pair of complementary sequences. All possible lengths \(n\leq 100\) are examined by this algorithm. For the entire collection see [Zbl 0944.00096].
Recommendations
Cited in
(7)- Periodic complementary binary sequences of length 50
- Binary odd-periodic complementary sequences
- Derived sequences of complementary symmetric Rote sequences
- Algorithm for the generation of complement-free sets
- On the Compatibility of Binary Sequences
- Complementary sets of sequences
- Boolean functions of binary type-II and type-III/II complementary array pairs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4664692)
