Analysis and design of stream ciphers
Analysis and design of stream ciphers
Introduction to finite fields and their applications
Introduction to finite fields and their applications
Sequences with almost perfect linear complexity profiles and curves over finite fields
IEEE Transactions on Information Theory
Proof of a conjecture on the joint linear complexity profile of multisequences
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
The probabilistic theory of the joint linear complexity of multisequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Multi-continued fraction algorithms and their applications to sequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
The minimal polynomial over Fq of linear recurring sequence over Fqm
Finite Fields and Their Applications
Levels of multi-continued fraction expansion of multi-formal Laurent series
Finite Fields and Their Applications
| Hi-index | 0.00 |
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 multisequences.