Ergodic theory, entropy, and coding problems of information theory
Pseudorandom binary sequences are required in stream ciphers and other applications of modern communication systems. In the first case it is essential that the sequences be unpredictable. The linear complexity of a sequence is the amount of it required to define the remainder. This work addresses the problem of the analysis and computation of the linear complexity of certain pseudorandom binary sequences. Finally we conclude some characteristics of the nonlinear function that produces the sequences...
For generator of the multiplicative group of the field , the discrete logarithm of an element of the field to the base , is that integer , . The -ary digits which represent can be described with extremely simple polynomial forms.
In the present paper, based on the concept of fuzzy entropy, an exponential intuitionistic fuzzy entropy measure is proposed in the setting of Atanassov's intuitionistic fuzzy set theory. This measure is a generalized version of exponential fuzzy entropy proposed by Pal and Pal. A connection between exponential fuzzy entropy and exponential intuitionistic fuzzy entropy is also established. Some interesting properties of this measure are analyzed. Finally, a numerical example is given to show that...
En esta comunicación, a partir del concepto de energía informacional de Onicescu para variables aleatorias discretas, se da el concepto de energía informacional para cualquier tipo de variables aleatorias como una extensión del anterior basándonos en el análisis no estándar de Robinson (1960). Se estudian sus propiedades y se analiza, en particular, su comportamiento con respecto a la energía informacional de Onicescu en caso de variables aleatorias continuas.