Codes avec des mots infinis
Codes générateurs minimaux de langages de mots bi-infinis
Codes générateurs minimaux de langages de mots bi-infinis
In this paper we give two families of codes which are minimal generators of biinfinite languages: the family of very thin codes (which contains the rational codes) and another family containing the circular codes. We propose the conjecture that all codes are minimal generators.
Coding in the existential theory of concatenation.
Coding theorems on generalized cost measure.
Color-texture-based image retrieval system using Gaussian Markov random field model.
Colouring of cycles in the de Bruijn graphs
We show that the problem of finding the family of all so called the locally reducible factors in the binary de Bruijn graph of order k is equivalent to the problem of finding all colourings of edges in the binary de Bruijn graph of order k-1, where each vertex belongs to exactly two cycles of different colours. In this paper we define and study such colouring for the greater class of the de Bruijn graphs in order to define a class of so called regular factors, which is not so difficult to construct....
Comments on some analytic inequalities.
Compact simple Lie groups and their -, -, and -transforms.
Compatibility relations on codes and free monoids
A compatibility relation on letters induces a reflexive and symmetric relation on words of equal length. We consider these word relations with respect to the theory of variable length codes and free monoids. We define an (R,S)-code and an (R,S)-free monoid for arbitrary word relations R and S. Modified Sardinas-Patterson algorithm is presented for testing whether finite sets of words are (R,S)-codes. Coding capabilities of relational codes are measured algorithmically by finding minimal and maximal relations....
Compression and restoration of square integrable functions.
Compression on the digital unit sphere.
Computation of centralizers in Braid groups and Garside groups.
We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conjugacy problem given by the authors in [9], are two main steps for solving conjugacy systems, thus breaking recently discovered cryptosystems based in braid groups [2]. We also present the result of our computations, where we notice that our algorithm yields surprisingly small generating sets for the centralizers.
Computing Igusa's local zeta functions of univariate polynomials, and linear feedback shift registers.
Computing the characteristic polynomials of a class of hyperelliptic curves for cryptographic applications.
Conditional entropy and Rokhlin metric
Connections between object classification criteria using an ultrasonic bi-sonar system
The paper presents connections between the criteria which make three types of objects possible to be recognized, namely, edges, planes and corners. These criteria can be applied while a binaural sonar system is used. It is shown that the criteria are specific forms of a general equation. The form of the equation depends on a single coefficient. In the paper, the meaning of this coefficient is discussed. The constructions of the arrangement of objects are presented and are bound with values of the...
Consensus and trajectory tracking of SISO linear multi-agent systems under switching communication topologies and formation changes
The simultaneous problem of consensus and trajectory tracking of linear multi-agent systems is considered in this paper, where the dynamics of each agent is represented by a single-input single-output linear system. In order to solve this problem, a distributed control strategy is proposed in this work, where the trajectory and the formation of the agents are achieved asymptotically even in the presence of switching communication topologies and smooth formation changes, and ensuring the closed-loop...
Construction de codes indécomposables
Construction of sampling and interpolating sequences for multi-band signals. the two-band case
Recently several papers have related the production of sampling and interpolating sequences for multi-band signals to the solution of certain kinds of Wiener-Hopf equations. Our approach is based on connections between exponential Riesz bases and the controllability of distributed parameter systems. For the case of two-band signals we derive an operator whose invertibility is equivalent to the existence of a sampling and interpolating sequence, and prove the invertibility of this operator.