AbstractWe show, in a particular case, the optimality of the conjecture of Perrin extending the Schreier formula of the free group to the free monoid. For this purpose, we construct a family of codes of minimal cardinality associated with finite abelian groups generated by two elements.RésuméNous montrons, dans un cas particulier, l'optimalité d'une conjecture de Perrin qui étend au monoïde libre la formule de Schreier du groupe libre. Pour cela, nous construisons une famille de codes de cardinalité minimale associés aux groupes abéliens finis à deux générateurs
For systematic codes over finite fields the following result is well known: If [I¦P] is the generato...
We develop three approaches of combinatorial flavor to study the structure of minimal codes and cutt...
Ce mémoire débute par l'étude des principales descriptions algébriques (polynomiale, spectrale, par ...
AbstractWe show, in a particular case, the optimality of the conjecture of Perrin extending the Schr...
Nous abordons trois axes de la combinatoire algébrique et énumérative. Le premier concerne principal...
In this paper we study polycyclic codes of length p s 1 × ⋯ × p s n p s 1 ×⋯×p s n ...
In this paper we give two families of codes which are minimal generators of biinfinite languages: th...
The study of group codes as an ideal in a group algebra has been developed long time ago. If char(F)...
AbstractLet d be the minimum distance of an (n, k) code C, invariant under an abelian group acting t...
The famous MacWilliams Extension Theorem states that for classical codes each linear Hamming isometr...
Nous demontrons que le groupe d'automorphismes des codes de Reed-Muller p-aires est le groupe genera...
AbstractWe compute the number of simple components of a semisimple finite abelian group algebra and ...
In this paper we study polycyclic codes of length $p^{s_1} \times \cdots \times p^{s_n}$\ over $\F_{...
AbstractIn this paper we show that two minimal codes M1 and M2 in the group algebra F2[G] have the s...
Let ℳ denote the Mathieu group on 24 points. Let G be the subgroup of ℳ which has three sets of tran...
For systematic codes over finite fields the following result is well known: If [I¦P] is the generato...
We develop three approaches of combinatorial flavor to study the structure of minimal codes and cutt...
Ce mémoire débute par l'étude des principales descriptions algébriques (polynomiale, spectrale, par ...
AbstractWe show, in a particular case, the optimality of the conjecture of Perrin extending the Schr...
Nous abordons trois axes de la combinatoire algébrique et énumérative. Le premier concerne principal...
In this paper we study polycyclic codes of length p s 1 × ⋯ × p s n p s 1 ×⋯×p s n ...
In this paper we give two families of codes which are minimal generators of biinfinite languages: th...
The study of group codes as an ideal in a group algebra has been developed long time ago. If char(F)...
AbstractLet d be the minimum distance of an (n, k) code C, invariant under an abelian group acting t...
The famous MacWilliams Extension Theorem states that for classical codes each linear Hamming isometr...
Nous demontrons que le groupe d'automorphismes des codes de Reed-Muller p-aires est le groupe genera...
AbstractWe compute the number of simple components of a semisimple finite abelian group algebra and ...
In this paper we study polycyclic codes of length $p^{s_1} \times \cdots \times p^{s_n}$\ over $\F_{...
AbstractIn this paper we show that two minimal codes M1 and M2 in the group algebra F2[G] have the s...
Let ℳ denote the Mathieu group on 24 points. Let G be the subgroup of ℳ which has three sets of tran...
For systematic codes over finite fields the following result is well known: If [I¦P] is the generato...
We develop three approaches of combinatorial flavor to study the structure of minimal codes and cutt...
Ce mémoire débute par l'étude des principales descriptions algébriques (polynomiale, spectrale, par ...