University of Isfahan Transactions on Combinatorics 2251-8657 6 3 2017 09 01 Binary sequence/array pairs via diference set pairs: A recursive approach 19 36 21466 10.22108/toc.2017.21466 EN K. T. Arasu Wright State University Anika Goyal Dept. of Computer Engg., YMCA University of Science And Technology, Faridabad, HR 121006, India Abhishek Puri Dept. of Computer Engg., YMCA University of Science And Technology, Faridabad, HR 121006, India Journal Article 2015 02 16 Binary array pairs with optimal/ideal correlation values and their algebraic counterparts "difference set pairs" (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. https://toc.ui.ac.ir/article_21466_7872b534dc27cd9c3fa2ab7a0cb15ba8.pdf