Es gibt keinen optimalen (n + 2,3)-Code einer ungeraden Ordnung n.
Essential Arity Gap of Boolean Functions
In this paper we investigate the Boolean functions with maximum essential arity gap. Additionally we propose a simpler proof of an important theorem proved by M. Couceiro and E. Lehtonen in [3]. They use Zhegalkin’s polynomials as normal forms for Boolean functions and describe the functions with essential arity gap equals 2. We use to instead Full Conjunctive Normal Forms of these polynomials which allows us to simplify the proofs and to obtain several combinatorial results concerning the Boolean functions...
Estimates of topological entropy of continuous maps with applications.
Estimating the angles of arrival of multiple plane waves. The statistical performance of the music and the minimum norm algorithms
Estimation of channel holding time distribution in cellular telephone systems.
Estimation of probabilistic noise models based on filtration of sample noise sequences
Estudio de algunas secuencias pseudoaleatorias de aplicación criptográfica.
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
Étude des questionnaires par l'analyse des correspondances. Modification du codage des questions ou de leur nombre et stabilité de l'analyse
Étude du problème du logarithme discret dans
Évariste Galois et la planète Mars : introduction à la théorie algébrique du codage
Evolutionary Design of Digital Circuits Using Improved Multi Expression Programming (IMEP).
Exact solutions to Waring's problem for finite fields
Exactly solvable and unsolvable shortest network problems in 3D-space.
Existence of feasible potentials on infinite networks.
Explicit form for the discrete logarithm over the field
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.
Exploring invariant linear codes through generators and centralizers
We investigate a -invariant linear code over the finite field where is a group of linear transformations. We show that if is a noncyclic abelian group and , then the code is the sum of the centralizer codes where is a nonidentity element of . Moreover if is subgroup of such that , , then dim is known when the dimension of is known for each subgroup of . 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
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
Extended Shannon entropies. II