Distance regularity of Kerdock codes.
Distances invariantes et L-cliques sur certains demi-groupes finis
Distributional solutions in information theory, I
Distributional solutions in information theory, II
Distributivity of strong implications over conjunctive and disjunctive uninorms
This paper deals with implications defined from disjunctive uninorms by the expression where is a strong negation. The main goal is to solve the functional equation derived from the distributivity condition of these implications over conjunctive and disjunctive uninorms. Special cases are considered when the conjunctive and disjunctive uninorm are a -norm or a -conorm respectively. The obtained results show a lot of new solutions generalyzing those obtained in previous works when the implications...
Divergence between various estimates of quantized information sources
Divergenzverhalten mehrdimensionaler Shannonscher Abtastreihen.
Divisible Codes - A Survey
This paper surveys parts of the study of divisibility properties of codes. The survey begins with the motivating background involving polynomials over finite fields. Then it presents recent results on bounds and applications to optimal codes.
Double fault distinguishability in linear systems
This paper develops a new approach to double fault isolation in linear systems with the aid of directional residuals. The method of residual generation for computational as well as internal forms is applied. Isolation of double faults is based on the investigation of the coplanarity of the residual vector with the planes defined by the individual pairs of directional fault vectors. Additionally, the method of designing secondary residuals, which are structured and directional, is proposed. These...
Dual codes of projective planes of order 25.
Duality for digital nets and its applications
Dynamical entropy of a non-commutative version of the phase doubling
A quantum dynamical system, mimicking the classical phase doubling map on the unit circle, is formulated and its ergodic properties are studied. We prove that the quantum dynamical entropy equals the classical value log2 by using compact perturbations of the identity as operational partitions of unity.
Dynamique des nombres et physique des oscillateurs
Nous présentons un modèle mathématique permettant de reproduire le spectre expérimental des fréquences dans un composant électronique appelé boucle ouverte. Le spectre semble s’organiser suivant une contrainte de nature diophantienne sur les fréquences. Sa structure peut donc se comprendre via une étude de l’ensemble des fractions continues en fonction de leur longueur et de la taille des quotients partiels.
Edon- – an efficient implementation of Edon- family of cryptographic hash functions
We have designed three fast implementations of a recently proposed family of hash functions Edon–. They produce message digests of length bits and project security of hash computations for finding collisions and hash computations for finding preimages and second preimages. The design is not the classical Merkle-Damgård but can be seen as wide-pipe iterated compression function. Moreover the design is based on using huge quasigroups of orders , and that are constructed by using only bitwise...
Efficient and effective total variation image super-resolution: a preconditioned operator splitting approach.
Efficient calculation of the Reed-Muller form by means of the Walsh transform
The paper describes a spectral method for combinational logic synthesis using the Walsh transform and the Reed-Muller form. A new algorithm is presented that allows us to obtain the mixed polarity Reed-Muller expansion of Boolean functions. The most popular minimisation (sub-minimisation) criterion of the Reed-Muller form is obtained by the exhaustive search of all the polarity vectors. This paper presents a non-exhaustive method for Reed-Muller expansions. The new method allows us to build the...
Efficient covering designs of the complete graph.
Efficient generation of 3D surfel maps using RGB-D sensors
The article focuses on the problem of building dense 3D occupancy maps using commercial RGB-D sensors and the SLAM approach. In particular, it addresses the problem of 3D map representations, which must be able both to store millions of points and to offer efficient update mechanisms. The proposed solution consists of two such key elements, visual odometry and surfel-based mapping, but it contains substantial improvements: storing the surfel maps in octree form and utilizing a frustum culling-based...
Efficient offline algorithmic techniques for several packet routing problems in distributed systems.
Efficient proprietary certification process and secured theft-protected proprietary certificates.