iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/BF01293261
Two families of low-correlated binary sequences | Applicable Algebra in Engineering, Communication and Computing Skip to main content
Springer Nature Link
Log in

Two families of low-correlated binary sequences

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

We apply a recent construction of binary Kerdock and Delsarte-Goethals codes in a cyclic form to construct good sequences with low cross-correlation.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Sidelnikov, V. M.: On mutual correlation of sequences. Soviet Math. Dokl.,12, (1) 197–201 (1971)

    Google Scholar 

  2. Levenshtein, V. I.: Bounds on the maximum cardinality of a code with bounded modules of the inner product. Soviet Math. Dokl.,25, (2), 526–531 (1982)

    Google Scholar 

  3. Nechaev, A. A.: Kerdock code in a cyclic form. Diskretnaya Matematika,1, (4), 123–139 (1989), in Russian (English translation in Discrete Math. Appl.,1, 365–384 (1991))

    Google Scholar 

  4. Hammons, A. R., Kumar, P. V., Calderbank, A. R., Sloane, N. J. A., Solé, P.: The Z4-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory,40, (2), 301–319 (1994)

    Google Scholar 

  5. Barg, A.: On small families of sequences with low periodic correlation. In: Cohen, G. et al. (ed.) Algebraic Coding (Lect. Notes Comp. Sci., vol. 781) Berlin, Heidelberg, New York: Springer 1994, pp. 154–158

    Google Scholar 

  6. MacWilliams, F. J., Sloane, N. J. A.: The Theory of Error-Correcting Codes. North-Holland 1981

  7. Tarnanen, H., Tietäväinen, A.: A simple method to estimate the maximum nontrivial correlation of some sets of sequences. AAECC5, 123–128 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Math. and Computer Science, Eindhoven University of Technology, Den Dolech 2, Postbus 513, 5600, MB, Eindhoven, The Netherlands

    A. Barg

Authors
  1. A. Barg
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

On leave from the Institute for Information Transmission Problems, Moscow, Russia.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Barg, A. Two families of low-correlated binary sequences. AAECC 7, 433–437 (1996). https://doi.org/10.1007/BF01293261

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01293261

Keywords

Search

Navigation