EuDML | Browse

The search session has expired. Please query the service again.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 461 – 480 of 1507

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

Étude de quelques signaux transitoires

Jacques Wolf (1973)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Étude des questionnaires par l'analyse des correspondances. Modification du codage des questions ou de leur nombre et stabilité de l'analyse

B. Escofier, B. Leroux (1975)

Mathématiques et Sciences Humaines

Étude du problème du logarithme discret dans $I F_{p^{3}}$

Ndiaye El Hadji Oumar (1995)

Annales de la Faculté des sciences de Toulouse : Mathématiques

Évariste Galois et la planète Mars : introduction à la théorie algébrique du codage

J. Wolfmann (1985)

Publications mathématiques et informatique de Rennes

Evolutionary Design of Digital Circuits Using Improved Multi Expression Programming (IMEP).

F. Z. Hadjam, C. Moraga, M. K. Rahmouni (2007)

Mathware and Soft Computing

Exact solutions to Waring's problem for finite fields

Arne Winterhof, Christiaan van de Woestijne (2010)

Acta Arithmetica

Exactly solvable and unsolvable shortest network problems in 3D-space.

Booth, R.S., Thomas, D.A., Weng, J.F. (2004)

Beiträge zur Algebra und Geometrie

Existence of feasible potentials on infinite networks.

Oettli, Werner, Yamasaki, Maretsugu (1996)

Journal of Convex Analysis

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 \neq 0$ is that integer $z : 1 \leq z \leq p^{k} - 1$ , $b = a^{z}$ . The $p$ -ary digits which represent $z$ can be described with extremely simple polynomial forms.

Exploring invariant linear codes through generators and centralizers

Partha Pratim Dey (2005)

Archivum Mathematicum

We investigate a $H$ -invariant linear code $C$ over the finite field $F_{p}$ where $H$ is a group of linear transformations. We show that if $H$ is a noncyclic abelian group and $(| H |, p) = 1$ , then the code $C$ is the sum of the centralizer codes $C_{c} (h)$ where $h$ is a nonidentity element of $H$ . Moreover if $A$ is subgroup of $H$ such that $A ≅ Z_{q} \times Z_{q}$ , $q \neq p$ , then dim $C$ is known when the dimension of $C_{c} (K)$ is known for each subgroup $K \neq 1$ of $A$ . In the last few sections we restrict our scope of investigation to a special class of invariant codes, namely affine...

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

Extended Shannon entropies. I

Miroslav Katětov (1983)

Czechoslovak Mathematical Journal

Extended Shannon entropies. II

Miroslav Katětov (1985)

Czechoslovak Mathematical Journal

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.

Currently displaying 461 – 480 of 1507

Previous Page 24 Next