Skip to main content
SpringerLink
Log in

The lower bound of the quadratic spans of Debruijn sequences

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

It is proven that the quadratic span of DeBruijn sequence of spann is at leastn+2, forn>3.

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

Access this article

Log in via an institution

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

References

  1. H. Fredricsen, A survey of full length nonlinear shift register cycle algorithms.SIMA Review, Vol. 24, (1982) pp. 195–221.

    Google Scholar 

  2. A.H. Chan and R.A. Games, On the quadratic spans of DeBruijn sequences.IEEE Trans. on Inform. Theory. Vol. 36, (1990), pp. 822–829.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Problems and Informatics and Automation, 375044 P. Sevak 1, Yerevan, Armenian Republic USSR

    Levon H. Khachatrian

Authors
  1. Levon H. Khachatrian
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by S.A. Vanstone

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khachatrian, L.H. The lower bound of the quadratic spans of Debruijn sequences. Des Codes Crypt 3, 29–32 (1993). https://doi.org/10.1007/BF01389353

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation