TY - JOUR
ID - 21466
TI - Binary sequence/array pairs via diference set pairs: A recursive approach
JO - Transactions on Combinatorics
JA - TOC
LA - en
SN - 2251-8657
AU - Arasu, K. T.
AU - Goyal, Anika
AU - Puri, Abhishek
AD - Wright State University
AD - Dept. of Computer Engg., YMCA University of Science And Technology, Faridabad, HR 121006, India
Y1 - 2017
PY - 2017
VL - 6
IS - 3
SP - 19
EP - 36
KW - autocorrelation
KW - binary sequence
KW - perfect sequence pair
KW - difference set pair
DO - 10.22108/toc.2017.21466
N2 - Binary array pairs with optimal/ideal correlation values and their algebraic counterparts textquotedblleft difference set pairstextquotedblright;(DSPs) in abelian groups are studied. In addition to generalizing known 1-dimensional (sequences) examples, we provide four new recursive constructions, unifying previously obtained ones. Any further advancements in the construction of binary sequences/arrays with optimal/ideal correlation values (equivalently cyclic/abelian difference sets) would give rise to richer classes of DSPs (and hence binary perfect array pairs). Discrete signals arising from DSPs find applications in cryptography, CDMA systems, radar and wireless communications.
UR - https://toc.ui.ac.ir/article_21466.html
L1 - https://toc.ui.ac.ir/article_21466_7872b534dc27cd9c3fa2ab7a0cb15ba8.pdf
ER -