binary sequence/array pairs via diference set pairs: a recursive approach

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 1dimensional (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‎.