Attention, cette page n'est pas à jour depuis un moment et ne contient rien de passionnant (pour le moment...)

Résumé: Nous étudions principalement une nouvelle famille de codes cycliques irréductibles possédant une propriété remarquable, leur distribution de poids est équilibrée (codes DPE). Nous caractérisons ces codes et nous montrons que leurs poids ne dépendent que de sommes de Gauss évaluées en des caractères d'un groupe particulier. Nous étudions aussi leurs propriétés combinatoires remarquables, notamment nous montrons que ces codes définissent des schémas d'association cyclotomiques. Une étude spécifique des sommes de Gauss nous permet de calculer les poids sur toute extension de GF( q ) à partir de la connaissance des poids du plus petit code sur le corps premier GF( p ). Nous explicitons aussi le comportement asymptotique des poids au regard de la borne de Weil-Serre dans ce sens où ces poids sont liés aux nombres de points rationnels de certaines courbes d'Artin-Schreier.

Mots Clefs: Formes coordonnées, codes C( f ), codes cycliques irréductibles, distribution de poids, codes DPE, sommes de caractères, sommes de Gauss, transformée de Fourier, schémas d'association cyclotomiques, courbes d'Artin-Schreier, borne de Weil-Serre.

Abstract: We study a new class of irreducible cyclic codes with a remarkable property, their weight distribution is balanced (BWD-codes). We characterize these codes and we show that their weights depend only on certain Gauss-sums for characters defined over a particular group. We also study their remarkable combinatorial properties, especially, we show that these codes define cyclotomic association schemes. A specific study of related Gauss-sums allows us to compute the weights on any extension of GF( q ) with the knowledge of the weights of the smallest code defined over the prime field GF( p ). We characterize the asymptotic behavior of weights compared to the Weil-Serre bound, in that sense the weights are related to the numbers of rational points of some Artin-Schreier curves.

Keywords: Coordinate forms,codes C( f ), irreducible cyclic codes, weight distribution, BWD-codes, character sums, Gauss sums, Fourier transform, cyclotomic association schemes, Artin-Schreier curves, Weil-Serre bound.

J.-P. Zanotti, "Codage d'un Signal Audionumérique sur un support à lecture optique", Rapport de Recherche (35 pages), INRIA, no. 3333, 1995.

Résumé: L'objet de cet article est d'étudier les différentes techniques de codage qui entrent en jeu dans la réalisatiojn du disque compact, codage à l'enregistrement et codage correcteur.

Mots Clefs: Disque compact, Code EFM, Code CIRC, codes de Reed-Solomon.

Abstract: A In this paper, we study particular linear codes defined over GF( q ), with an astonishing property, their weight distribution is balanced, i.e. there is the same number of codewords for each nonzero weight of the code. We call these codes BWD-codes. We first study BWD-codes by means of the Pless identities and we completely characterize the two-weight projective case. We study the class of codes defined under subgroups of the multiplicative group of GF( q^s) using the Gauss sums. Then, given a prime p and an integer N dividing p - 1, we construct all the N-weight BWD-codes of that class. We conclude this paper by some tables of BWD-codes and an open problem.

Keywords: BWD-codes, codes under groups, Gauss sums, irreducible cyclic codes, trace function, transposed codes.

P. Langevin, J.-P. Zanotti, "Fonctions booléennes équilibrées I" , Rapport de recherche (60 pages), Contrat de recherche SCSSI (Services Centraux de Sécurité des Systèmes d'Information), diffusion restreinte, 1995.

Abstract: Theoretical study of highly non-linear boolean functions, and balanced highly non-linear functions.

J.-P. Zanotti, "Weight Behavior of Irreducible Cyclic BWD-Codes", Finite Fields and Their Applications, vol. 2, no. 2, pp. 192-203, 1996.

Abstract: In a previous paper, we have introduced a new class of codes called BWD-codes, with a remarkable property, their weight distribution is balanced, i.e. there are the same number of codewords for each non-zero weight. The aim of this paper is to study the weights of such codes in the irreducible cyclic case. First we recall the fundamental property of BWD-codes and we start this study from a deep link between weights and Gauss sums. We see that this particular situation is, roughly speaking, at the opposite of those studied by McEliece. We give the weights for the two-weight case, and we show that the weights of any N-weight BWD-code defined over GF( q ) is completely determined by the N-weights of a BWD-code of dimension N defined over the prime field GF( p ). The main result is on the asymptotic behavior of Gauss sums over GF( p ), by means of a nice technique introduced by Rodier.

Keywords: BWD-codes, irreducible cyclic codes, Gauss sums, Fourier transform, trace function, cyclotomic fields, Ax's theorem, Kronecker's theorem, Stickelberger's theorem, Weil-Serre's bound.

J.-P. Zanotti, "Automorphism Groups of BWD Codes", Journal of Combinatorial Theory (series A), vol. 78, no. 2, pp 303-308, 1997.

Abstract: In this paper we characterize the automorphism group of a particular class of irreducible cyclic codes by means of an important theorem of Carlitz and McConnel. The BWD-codes (Balanced Weight Distribution) have been introduced in a previous paper and have the remarkable property that each non-zero weight appears with the same multiplicity. We show that an irreducible cyclic BWD-code with N non-zero weights defines an association scheme with N classes. We study such a code from two different point of vue: the code as a K-subspace of Kⁿ where K is a finite field, and the code through an extension [ L : K ] isomorphic to the code C. From the first one, the code is a subscheme of the Hamming scheme and from the second one, it is a cyclotomic scheme.

Keywords: Automorphism group, BWD-codes, cyclotomic schemes, Hamming schemes, irreducible cyclic codes.

P. Langevin, P Véron, J.-P. Zanotti, "Fonctions booléennes équilibrées II" , Rapport de recherche (64 pages), Contrat de recherche SCSSI (Services Centraux de Sécurité des Systèmes d'Information), diffusion restreinte, 1997.

Abstract: Theoretical study of highly non-linear boolean functions, and balanced highly non-linear functions.