Binary sequence/array pairs via diference set pairs: A recursive approach

Document Type : Research Paper


1 Wright State University

2 Dept. of Computer Engg., YMCA University of Science And Technology, Faridabad, HR 121006, India


Binary array pairs with optimal/ideal correlation values and their algebraic counterparts \textquotedblleft difference set pairs\textquotedblright\;(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‎.


Main Subjects

[1] F. Mao, T. Jiang, C. lin Zhao and Z. Zhou, Study of pseudorandom binary sequence pairs, J. Commun., 26 (2005) 94-98.
[2] X. Peng, C. Xu and K. T. Arasu, New families of binary sequence pairs with two-level and three-level correlation, IEEE Trans. Inform. Theory, 58 (2012) 6968-6978.
[3] C. Q. Xu, Differences set pairs and approach for the study of p erfect binary array pairs, Acta Electron. Sin., 29 (2001) 87-89.
[4] X. Zhao, W. He, Z. Wang and S. Jia, The theory of the p erfect binary array pairs, Acta Electron. Sin., 27 (1999) 34-37.
[5] H. Rohling and W. Plagge, Mismatched- lter design for p erio dic binary phased signals, IEEE Trans. Aerosp. Electron. Syst., 25 (1989) 890-897.
[6] S. W. Golomb and G. Gong, Signal design for good correlation: For wireless communication, cryptography, and radar. Cambridge University Press, Cambridge, 2005.
[7] Q. Li, J. Gao and X. Zhao, The application of the ZCZ sequence pairs set in QS-CDMA system, 3rd International Workshop on Signal Design and Its Applications in Communications, 2007 288-291.
[8] D. Jungnickel and A. Pott, Perfect and almost p erfect sequences, Discrete Appl. Math., 95 (1999) 331-359.
[9] K. T. Arasu, Sequences and arrays with desirable correlation properties, Information Security, Co ding Theory and Related Combinatorics, NATO Sci. Peace Secur. Ser. D Inf. Commun. Secur, Amsterdam, 29 (2011) 136-171.
[10] K. T. Arasu, V. Hariharan, D. Hilton and S. K. Sehgal, On difference set pairs in abelian groups, (Preprint) 2013.
[11] A. Pott, Finite geometry and character theory, Lecture notes in mathematics, pringer-Verlag, Berlin, 1995.
[12] T. Beth, D. Jungnickel and H. Lenz, Design theory, Second edition, Encyclop edia of Mathematics and its Applications, Cambridge University Press, Cambridge, 1999.
[13] M. Hall, Combinatorial theory, Reprint of the 1986 second edition, Wiley Classics Library, A Wiley-Interscience Publication, John Wiley Sons, Inc., New York, 1998.
[14] S. Ma, A survey of partial difference sets, Des. Codes Cryptogr., 4 (1994) 221-261.
[15] P. Ke, W. Yu and Z. Chang, A note on binary sequence pairs with two-level correlation, Inform. Process. Lett., 113 (2013) 811-814.
[16] J. F. Dillon and H. Dobb ertin, New cyclic difference sets with singer parameters, Finite Fields Appl., 10 (2004) 342-389.
[17] S.-Y. Jin and H.-Y. Song, Binary sequence pairs with two-level correlation and cyclic difference pairs, IEICE TRANS. FUNDAMENTALS, 93 (2010) 2266-2271.
[18] Y.-G. Jia, F.-Z. Ren, Y.-F. Ji, Y.-S. Liu and J. Ren, Two methods for constructing the difference set pairs, Published in: Pervasive Computing Signal Pro cessing and Applications (PCSPA), 2010 First International Conference on, 2010 675-678.