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
Extensión del concepto de energía informacional de Onicescu basado en el análisis no estandar.
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.
Extensions of Foster's averaging formula to infinite networks with moderate growth.
Extensions of the Shannon entropy to semimetrized measure spaces
Extremal Polynomials for Obtaining Bounds for Spherical Codes and Designs.
Extreme symmetry and the directed divergence in information theory
Factorization Methods in Cryptosystems
Factorized mutual information maximization
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.
Failure of random networks.
Families of nets of low and medium strength.
Fast and accurate methods of independent component analysis: A survey
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).
Fast computation of Gauss sums and resolution of the root of unity ambiguity
Faster backtracking algorithms for the generation of symmetry-invariant permutations.