Displaying 301 – 320 of 961

Showing per page

Estudio de algunas secuencias pseudoaleatorias de aplicación criptográfica.

P. Caballero Gil, A. Fúster Sabater (1998)

Revista Matemática Complutense

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...

Explicit form for the discrete logarithm over the field GF ( p , k )

Gerasimos C. Meletiou (1993)

Archivum Mathematicum

For a generator of the multiplicative group of the field G F ( p , k ) , the discrete logarithm of an element b of the field to the base a , b 0 is that integer z : 1 z p k - 1 , b = a z . The p -ary digits which represent z can be described with extremely simple polynomial forms.

Exponential entropy on intuitionistic fuzzy sets

Rajkumar Verma, Bhu Dev Sharma (2013)

Kybernetika

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...

Extensión del concepto de energía informacional de Onicescu basado en el análisis no estandar.

Leandro Pardo (1985)

Trabajos de Estadística e Investigación Operativa

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.

Factorized mutual information maximization

Thomas Merkh, Guido F. Montúfar (2020)

Kybernetika

We investigate the sets of joint probability distributions that maximize the average multi-information over a collection of margins. These functionals serve as proxies for maximizing the multi-information of a set of variables or the mutual information of two subsets of variables, at a lower computation and estimation complexity. We describe the maximizers and their relations to the maximizers of the multi-information and the mutual information.

Fast and accurate methods of independent component analysis: A survey

Petr Tichavský, Zbyněk Koldovský (2011)

Kybernetika

This paper presents a survey of recent successful algorithms for blind separation of determined instantaneous linear mixtures of independent sources such as natural speech or biomedical signals. These algorithms rely either on non-Gaussianity, nonstationarity, spectral diversity, or on a combination of them. Performance of the algorithms will be demonstrated on separation of a linear instantaneous mixture of audio signals (music, speech) and on artifact removal in electroencephalogram (EEG).

Currently displaying 301 – 320 of 961