Skip to main content
SpringerLink
Log in

A Unified View on Sequence Complexity Measures as Isometries

(Extended Abstract)

  • Conference paper
Sequences and Their Applications - SETA 2004 (SETA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3486))

Included in the following conference series:

Abstract

We show how to model complexities (linear, 2–adic, tree, etc.), compression schemes (Lempel–Ziv, etc.), and predictors (Markov chains, etc.) in a uniform way as isometries.

This isometric setting allows to sort out nonrandom sequences as they violate the bounds of the ”Law of the Iterated Logarithm”.

We also consider the computational complexity of calculating the isometric models, as well as how to deal with finite sequences.

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. del, M., Canales Chacón, P., Vielhaber, M.: Structural and Computational Complexity of Isometries and their Shift Commutators. In: Electronic Colloquium on Computational Complexity, ECCC TR04–057 (2004)

    Google Scholar 

  2. Christol, G., Kamae, T., Mendès–France, M., Rauzy, G.: Suites algébriques, automates et substitutions. Bull. Soc. Math. France 108, 401–419 (1980)

    MATH  MathSciNet  Google Scholar 

  3. Deheuvels, P.: On the Erdős–Rényi theorem for random fields and sequences and its relationship with the theory of runs and spacings. Z. Wahrschein. verw. Gebiete 70, 91–115 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dornstetter, J.L.: On the equivalence between Berlekamp’s and Euclid’s algorithm. IEEE Trans. Inform. Th. 33(3), 428–431 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  5. Erdős, P.: On the law of the iterated logarithm. Ann. Math. 43, 419–436 (1942)

    Article  Google Scholar 

  6. Erdős, P., Révész, P.: On the length of the longest head–run. Colloq. Math. Soc. J. Bolyai, Topics in Information Theory 16, Keszthely, 219–228 (1975)

    Google Scholar 

  7. Feller, W.: An Introduction to Probability Theory and Its Applications I, 3rd edn. John Wiley & Sons, New York (1968)

    MATH  Google Scholar 

  8. Feller, W.: The general form of the so–called law of the iterated alogarithm. Trans. Amer. Math. Soc. 51, 373–402 (1943)

    Article  MathSciNet  Google Scholar 

  9. Klapper, A., Goresky, M.: 2–adic shift registers. In: Fast Software Encryption, Cambridge Security Workshop Proc., Springer, Heidelberg (1994)

    Google Scholar 

  10. Klapper, A., Goresky, M.: Feedback Shift Registers, Combiners with Memory, and 2–adic Span. J. Cryptology 10(2), 111–147 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kolmogoroff, A.: Über das Gesetz des iterierten Logarithmus. Math. Ann. 101, 126–135 (1929)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lagrange, J.L.: Additions au mémoire sur la résolution des équations numériques. Mém. Berl. 24 (1770)

    Google Scholar 

  13. Niederreiter, H.: Some computable complexity measures for binary sequences. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and their Applications SETA 1998. Springer, Heidelberg (1999)

    Google Scholar 

  14. Niederreiter, H., Vielhaber, M.: Tree complexity and a doubly exponential gap between structured and random sequences. J. Complexity 12(3), 187–198 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  15. Niederreiter, H., Vielhaber, M.: Simultaneous shifted continued fraction expansions in quadratic time. AAECC 9(2), 125–138 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  16. Niederreiter, H., Vielhaber, M.: An algorithm for shifted continued fraction expansions in parallel linear time. Theoretical Computer Science 226, 93–104 (1999)

    MATH  MathSciNet  Google Scholar 

  17. Perron, O.: Die Lehre von den Kettenbrüchen I, Teubner, Stuttgart, 1954/1977

    Google Scholar 

  18. Piper, F.: Stream ciphers. Elektrotechnik und Maschinenbau 104, 564–568 (1987)

    Google Scholar 

  19. Révész, P.: Random walk in random and non–random environments. World Scientific, Singapore (1990)

    MATH  Google Scholar 

  20. Révész, P.: Strong theorems on coin tossing. In: Proc. Int. Cong. of Mathematicians, Helsinki, pp. 749–754 (1978)

    Google Scholar 

  21. Shallit, J., Breitbart, Y.: Automaticity I: Properties of a Measure of Descriptional Complexity. J. Comput. Syst. Sci. 53(1), 10–25 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  22. Vielhaber, M.: Continued Fraction Expansion as Isometry: The Law of the Iterated Logarithm for Linear, Jump, and 2–Adic Complexity (submitted)

    Google Scholar 

  23. Wang, M.: Linear complexity profiles and continued fractions. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 571–585. Springer, Heidelberg (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto de Matemáticas, Universidad Austral de Chile, Casilla 567, Valdivia, Chile

    Michael Vielhaber

Authors
  1. Michael Vielhaber
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway

    Tor Helleseth

  2. University of Ilinois at Urbana-Champaign, 1406 West Green Street, IL 61801, Urbana, USA

    Dilip Sarwate

  3. Department of Electrical and Electronic Engineering, Yonsei University, 121-749, Seoul, Korea

    Hong-Yeop Song

  4. Dept. of Electronics and Electrical Engineering, Pohang University of Science and Technology (POSTECH), 790-784, Pohang, Kyungbuk, Korea

    Kyeongcheol Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vielhaber, M. (2005). A Unified View on Sequence Complexity Measures as Isometries. In: Helleseth, T., Sarwate, D., Song, HY., Yang, K. (eds) Sequences and Their Applications - SETA 2004. SETA 2004. Lecture Notes in Computer Science, vol 3486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11423461_8

Download citation

  • DOI: https://doi.org/10.1007/11423461_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26084-4

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation