Skip to main content
SpringerLink
Log in

New Constructions of Large Binary Sequences Family with Low Correlation

  • Conference paper
Information Security and Cryptology (Inscrypt 2006)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 4318))

Included in the following conference series:

  • 761 Accesses

Abstract

A new family of binary sequences S e (ρ) (U e (ρ)) of period 2n–1 is constructed for odd (even) n=me and an integer ρ with 1 ≤ ρ< ⌈ \(\frac{m}{2}\) ⌉. The new family S e (ρ) (or U e (ρ)) contains Kim and No’s construction as a subset if m-sequences are excluded from both constructions. Furthermore, the new sequences are proved to have low correlation property, large linear span and large family size.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Simon, M.K., Omura, J., Scholtz, R., Levitt, K.: Spread Spectrum Communications, vol. I–III. Computer Science, Rockville, MD (1985)

    Google Scholar 

  2. Gold, R.: Maximal recursive sequences with 3-valued recursive crosscorrelation functions. IEEE Tran. on Info. theory IT-14(1), 154–156 (1968)

    Article  Google Scholar 

  3. Kasami, T.: Weight enumerators for several classes of subcodes of the 2nd order Reed-Muller codes. Inf. Contr. 18, 369–394 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  4. Kim, S.H., No, J.S.: New families of binary sequences with low correlation. IEEE Tran. on Info. theory 49(11), 3059–3065 (2003)

    Article  MathSciNet  Google Scholar 

  5. Boztas, S., Kumar, P.V.: Binary sequences with Gold-like correlation but larger linear span. IEEE Tran. on Info. theory 40(2), 532–537 (1994)

    Article  MATH  Google Scholar 

  6. Udaya, P.: Polyphase and Frequency Hopping Sequences Obtained from Finite Rings. Ph.D. dissertation, Dept. Elec. Eng., Indian Inst. Technol., Kanpur, India (1992)

    Google Scholar 

  7. Trachtenberg, H.M.: On the crosscorrelation functions of maximal linear recurring sequences. Ph.D. dissertation, Univ. South. Calif., Los Angeles (1970)

    Google Scholar 

  8. Helleseth, T.: Some results about the cross-correlation function between two maximal linear sequences. Discr. Math. 16, 209–232 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  9. Tang, X., Udaya, P., Fan, P.: A new family of nonbinary sequences with three-level correlation property and large linear span. IEEE Tran. on Info. theory 51(8), 2906–2914 (2005)

    Article  MathSciNet  Google Scholar 

  10. Yu, N.Y., Gong, G.: A New Binary Sequence Family With Low Correlation and Large Size. IEEE Tran. on Info. theory 52(4), 1624–1636 (2006)

    Article  MathSciNet  Google Scholar 

  11. Olsen, J.D., Scholtz, R.A., Welch, L.R.: Bent-function sequences. IEEE Tran. on Info. theory 28(6), 858–864 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  12. MacWilliams, F.J., Sloane, N.J.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)

    MATH  Google Scholar 

  13. Golomb, S.W., Gong, G.: Signal Design for Good Correlation-For Wireless Communication. Cryptography and Radar. Cambridge Univ. Press, New York (2005)

    Google Scholar 

  14. Helleseth, T., Kumar, P.V.: Sequences with low correlation. In: Pless, V., Huffman, C. (eds.) Handbook of Coding Theory. Elsevier, Amsterdam (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Science, Beijing University of Posts and Telecommunications, Beijing, 100876, China

    Xin Tong, Jie Zhang & Qiao-Yan Wen

Authors
  1. Xin Tong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jie Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qiao-Yan Wen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University College London, UK

    Helger Lipmaa

  2. Computer Science Department, Google Inc. and Columbia University, 1214 Amsterdam Avenue, 10027, New York, NY, USA

    Moti Yung

  3. SKLOIS Lab, Institute of Software, Chinese Academy of Sciences, 100080, Beijing, P.R. China

    Dongdai Lin

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tong, X., Zhang, J., Wen, QY. (2006). New Constructions of Large Binary Sequences Family with Low Correlation. In: Lipmaa, H., Yung, M., Lin, D. (eds) Information Security and Cryptology. Inscrypt 2006. Lecture Notes in Computer Science, vol 4318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11937807_4

Download citation

  • DOI: https://doi.org/10.1007/11937807_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49608-3

  • Online ISBN: 978-3-540-49610-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation