Displaying similar documents to “On the joint 2-adic complexity of binary multisequences∗”

On the joint 2-adic complexity of binary multisequences

Lu Zhao, Qiao-Yan Wen (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the case of multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for the multisequences with -period, we discuss the relation between sequences and their Fourier coefficients. Based on the relation, we determine a lower bound for the number of multisequences with given joint 2-adic...

Rational base number systems for p-adic numbers

Christiane Frougny, Karel Klouda (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

This paper deals with rational base number systems for -adic numbers. We mainly focus on the system proposed by Akiyama in 2008, but we also show that this system is in some sense isomorphic to some other rational base number systems by means of finite transducers. We identify the numbers with finite and eventually periodic representations and we also determine the number of representations of a given -adic number.

Rational base number systems for -adic numbers

Christiane Frougny, Karel Klouda (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

This paper deals with rational base number systems for -adic numbers. We mainly focus on the system proposed by Akiyama in 2008, but we also show that this system is in some sense isomorphic to some other rational base number systems by means of finite transducers. We identify the numbers with finite and eventually periodic representations and we also determine the number of representations of a given -adic number.