Skip to main content

The Hausdorff Dimension of the Set of r-Perfect M-Multisequences

  • Conference paper
Sequences and Their Applications – SETA 2006 (SETA 2006)

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

Included in the following conference series:

Abstract

We introduce a stochastic infinite state machine (Markov chain) BDM, the “Battery–Discharge–Model”, which keeps track of all linear complexities of all q M.n prefixes of length n of M-multisequences over \({\mathbb {F}}_q\).

We then use a finite subset of the BDM, dealing with those multisequences which are r-perfect. The largest eigenvalue λ of its transition matrix then yields the Hausdorff dimension of the set of r-perfect multisequences as

$$D_H = 1+ \frac{\log_q(\lambda)}{M}.$$

Also, we give a general formula for 1-perfect multisequences, for any M and q.

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

Access this chapter

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 Canales Chacón, M.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. Dai, Z., Feng, X.: Multi–Continued Fraction Algorithm and Generalized B–M Algorithm over F2. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, Springer, Heidelberg (2005)

    Google Scholar 

  3. Falconer, K.: Fractal Geometry — Mathematical Foundations and Applications. Wiley, Chichester (1990)

    MATH  Google Scholar 

  4. Niederreiter, H., Vielhaber, M.: Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles. J. Cpx 13, 353–383 (1997)

    MATH  MathSciNet  Google Scholar 

  5. Vielhaber, M.: A Unified View on Sequence Complexity Measures as Isometries. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 143–153. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Xing, C.: Multi–sequences with Almost Perfect Linear Complexity Profile and Function Fields over Finite Fields. J. Cpx 16, 661–675 (2000)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vielhaber, M., del Pilar Canales Ch., M. (2006). The Hausdorff Dimension of the Set of r-Perfect M-Multisequences. In: Gong, G., Helleseth, T., Song, HY., Yang, K. (eds) Sequences and Their Applications – SETA 2006. SETA 2006. Lecture Notes in Computer Science, vol 4086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11863854_22

Download citation

  • DOI: https://doi.org/10.1007/11863854_22

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44524-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics