Skip to main content
SpringerLink
Log in

Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2227))

Abstract

Cyclotomic constructions are given for several infinite families of even length binary sequences which have low negaperiodic autocor- relation. It appears that two of the constructions have asymptotic Merit Factor 6 .0 which is very high. Mappings from periodic to negaperiodic autocorrelation are also discussed.

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. Ding, C., Helleseth, T., Martinsen, H.M.: New Classes of Binary Sequences with Three-Level Autocorrelation. IEEE Trans. Inform. Theory 47 1. Jan. (2001) 428–433

    Google Scholar 

  2. Golay, M.J.E.: Complementary Series. IRE Trans. Inform. Theory IT-7 Apr. (1961)82–87

    Google Scholar 

  3. M.J.E.Golay, M.J.E.: Sieves for Low Autocorrelation Binary Sequences. IEEE Trans. Inform. Theory 23 1. Jan. (1977) 43–51

    Google Scholar 

  4. Golay, M.J.E.: The Merit Factor of Long Low Autocorrelation Binary Sequences. IEEE Trans. Inform. Theory 28 3. May (1982) 543–549

    Google Scholar 

  5. Golay, M.J.E.: A New Search for Skewsymmetric Binary Sequences with Optimal Merit Factors. IEEE Trans. Inform. Theory 36 5. Sept. (1990) 1163–1166

    Google Scholar 

  6. Høholdt, T., Jensen, H.E., Justesen, J.: Aperiodic Correlations and the Merit Factor of a Class of Binary Sequences. IEEE Trans. Inform. Theory 31 4. July (1985) 549–552

    Google Scholar 

  7. Jensen, J.M., Elbrønd Jensen, H., Høholdt T.: The Merit Factor of Binary Sequences Related to Difference Sets. IEEE Trans. Inform. Theory 37 3. May (1991) 617–626

    Google Scholar 

  8. Høholdt, T.: The Merit Factor of Binary Sequences. Difference Sets, Sequences and their Correlation Properties, A. Pott et a.(eds.), Series C: Mathematical and Physical Sciences, Kluwer Academic Publishers 542 (1999) 227–237

    Google Scholar 

  9. Luke, H.D.: Binary Odd-Periodic Complementary Sequences. IEEE Trans. Inform. Theory 43 1. Jan. (1997) 365–367

    Google Scholar 

  10. Parker, M.G., Tellambura, C.: Generalised Rudin-Shapiro Constructions. WCC2001,Workshop on Coding and Cryptography, Paris (France) Jan. 8-12 (2001)

    Google Scholar 

  11. Paterson, K.G., Tarokh, V.: On the Existence and Construction of Good Codes with Low Peak-to-Average Power Ratios. IEEE Trans. Inform. Theory 46 6. Sept. (2000) 1974–1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Code Theory Group, Inst. for Informatikk, HIB, University of Bergen, Norway

    Matthew G. Parker

Authors
  1. Matthew G. Parker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, RMIT University, GPO Box 2476V, 3001, Melbourne, Australia

    Serdar Boztaş

  2. Department of Computing, Macquarie University, 2109, NSW, Australia

    Igor E. Shparlinski

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parker, M.G. (2001). Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation. In: Boztaş, S., Shparlinski, I.E. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2001. Lecture Notes in Computer Science, vol 2227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45624-4_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-45624-4_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42911-1

  • Online ISBN: 978-3-540-45624-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation