Abstract
Binary sequences with good autocorrelation and large linear complexity are needed in many applications. As an application of theory of interleaved sequences, one family of binary pseudo-random sequences is constructed. Furthermore, the autocorrelation values and linear complexity of such constructed binary sequences are derived in this paper.
This work is supported by the Natural Science Foundation of China (Grant Nos. 61102093, 61174085).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Antweiler, M., Bomer, L.: Complex sequences over GF(p M) with a two-level autocorrelation function and a large span. IEEE Transactions on Information Theory 38, 120–130 (1982)
Cai, Y., Ding, C.: Binary sequences with optimal autocorrelation. Theorem Computer Science 410, 2316–2322 (2009)
Gong, G.: Run, component sequences and vector sequences of m-sequences over Galois fields. Acta Etectronica Sinica 35(4), 94–100 (1986)
Gong, G.: On q-ary sequences generated by mapping GF(q m) sequences into GF(q). Fondazione Ugo Bordoni Rome. Rep. 3B00692 (January 1992)
Gong, G.: Linear space decomposition of sequences over GF(q m) (August 1993)
Gong, G.: Theory and application of q-ary interleaved sequences. IEEE Transactions on Information Theory 41(3), 400–411 (1995)
Gong, G.: Q-ary cascaded GMW sequences. IEEE Transactions on Information Theory 42, 263–267 (1996)
Golomb, S.W., Gong, G.: Signal Design for Good Correlation-For Wireless Communication, Cryptography and Radar. Cambridge Univ. Press (2005)
Lidl, R., Niederreiter, H.: Finite Fields. Cambridge Univ. Press (1997)
Park, W.J., Komo, J.J.: it Relations hips between m-sequences over GF(q) and GF(q m). IEEE Transactions on Information Theory 35(1), 183–186 (1989)
Singer, J.: A theorem in finite protective geometry and some application to number theorem. Transactions Amercian Mathmatics Society 43(1), 377–385 (1938)
Wang, Q.: The linear complexity of some binary sequences with three-level autocorrelation. IEEE Transactions on Information Theory 56, 4046–4052 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, Z., Li, D. (2012). The Generalized Construction and Linear Complexity of Binary Sequences with Three-Level Autocorrelation Values. In: Xiang, Y., Pathan, M., Tao, X., Wang, H. (eds) Data and Knowledge Engineering. ICDKE 2012. Lecture Notes in Computer Science, vol 7696. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34679-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-34679-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34678-1
Online ISBN: 978-3-642-34679-8
eBook Packages: Computer ScienceComputer Science (R0)