Codes avec des mots infinis
Codes bipréfixes et groupes de permutations
Codes correcteurs d'erreurs.
Codes de Goppa
Codes et formes quadratiques
Codes from cubic curves and their extensions.
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.
Codes, lattices, and Steiner systems.
Codes that attain minimum distance in every possible direction
The following problem motivated by investigation of databases is studied. Let be a q-ary code of length n with the properties that has minimum distance at least n − k + 1, and for any set of k − 1 coordinates there exist two codewords that agree exactly there. Let f(q, k)be the maximum n for which such a code exists. f(q, k)is bounded by linear functions of k and q, and the exact values for special k and qare determined.
Coding in the existential theory of concatenation.
Coding theorems on generalized cost measure.
Colorings and nowhere-zero flows of graphs in terms of Berlekamp's switching game.
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....
Combinatorial aspects of code loops
The existence and uniqueness (up to equivalence defined below) of code loops was first established by R. Griess in [3]. Nevertheless, the explicit construction of code loops remained open until T. Hsu introduced the notion of symplectic cubic spaces and their Frattini extensions, and pointed out how the construction of code loops followed from the (purely combinatorial) result of O. Chein and E. Goodaire contained in [2]. Within this paper, we focus on their combinatorial construction and prove...
Combinatorial polarization, code loops, and codes of high level.
Combinatorics of singly-repairable families.
Combined complexity classes for finite functions
Comment on “Convergence properties of adaptive threshold elements...”