Multi-sequences with d-perfect property
| Autor: | Xiutao Feng, Quanlong Wang, Zongduo Dai |
|---|---|
| Rok vydání: | 2005 |
| Předmět: |
Statistics and Probability
Theoretical computer science Property (philosophy) Control and Optimization General Mathematics Pseudorandomness Pseudorandom generator Measure (mathematics) Pseudorandom function family Multi-sequences Pseudorandom noise Randomness Computer Science::Cryptography and Security Mathematics Pseudorandom number generator Discrete mathematics Linear complexity Numerical Analysis Conjecture Algebra and Number Theory Applied Mathematics TheoryofComputation_GENERAL Pseudorandom generator theorem Linear complexity profile m-continued fraction Algebra d-perfect |
| Zdroj: | ISIT |
| ISSN: | 0885-064X |
| DOI: | 10.1016/j.jco.2004.04.004 |
| Popis: | Sequences with almost perfect linear complexity profile are defined by Niederreiter (Proceedings of the Salzburg Conference 1986, Vol. 5, Teubner, Stuttgart, 1987, pp. 221–233). Xing and Lam (IEEE Trans. Inform. Theory 45 (1999) 1267; J. Complexity 16 (2000) 661) extended this concept from the case of single sequences to the case of multi-sequences and further proposed the concept of d-perfect multi-sequences. In this paper, based on the technique of m-continued fractions due to Dai et al. we investigate the property of d-perfect multi-sequences and obtain a sufficient and necessary condition of d-perfect multi-sequences. We show that d-perfect multi-sequences are not always strongly d-perfect. In particular, we give an example to disprove the conjecture proposed by Xing (2000) on d-perfect multi-sequences. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect