Précédent : Expertises Remonter : Projet CODES
Suivant : Abstract
- Livres
- 1
- P. CAMION
(réd.), Codes and association schemes, Handbook of
Coding Theory, 1996. En préparation.
- Thèses
- 2
- T. BERGER,
Groupes d'automorphismes et de permutations des codes
affine-invariants, Habilitation à diriger des recherches,
Université Limoges, janvier 1996.
- 3
- A. CANTEAUT,
Attaques de cryptosystèmes à mots de poids faible et
construction de fonctions t-résilientes, thèse de
doctorat, Université Paris 6, octobre 1996.
- 4
- G. HACHé,
Construction effective des codes géométriques, thèse
de doctorat, Université Paris 6, septembre 1996.
- Articles
- 5
- D. AUGOT,
P. CAMION, ``On the
computation of minimal polynomial, cyclic vectors and the
Frobenius forms'', Linear Algebra and Its
Applications, 1996, A paraître.
- 6
- D. AUGOT,
F. LEVY-DIT-VEHEL, ``Bounds on the minimum
distance of the duals of BCH codes'', IEEE Transaction on
Information Theory 42, 4, juillet 1996.
- 7
- D. AUGOT,
``Description of minimum weight codewords of cyclic codes by
algebraic systems'', Finite Fields and their
Applications, 2, 1996, p. 138-152.
- 8
- T. BERGER,
P. CHARPIN, ``Groupe
de permutations des codes affine-invariants'', Compte
Rendus de l'Academie des Sciences de Paris t.321, 1996,
p. 1383-1387.
- 9
- T. BERGER,
P. CHARPIN, ``The
permutation group of affine-invariant extended cyclic codes'',
IEEE Transaction on Information Theory, 1996, A
paraître.
- 10
- T. BERGER, ``On
the automorphism groups of affine-invariant codes'',
Designs Codes and Cryptography, 7, 1996,
p. 215-221.
- 11
- A. CANTEAUT,
F. CHABAUD, ``A new
algorithm for finding minimum-weight words in a linear code:
application to primitive narrow-sense BCH codes of
length 511'', IEEE Transactions on Information
Theory, 1996, A paraître.
- 12
- C. CARLET,
P. GUILLOT, ``Une
caractérisation des fonctions courbes'', Compte Rendus de
l'Academie des Sciences de Paris, 1995, A paraître.
- 13
- C. CARLET,
P. GUILLOT, ``A
characterization of binary bent functions'', Journal of
Combinatorial Theory, Series A, 1996, A paraître.
- 14
- C. CARLET,
``Generalized partial spreads'', IEEE Transaction on
Information Theory 41, 5, 1995, p. 1482-1487.
- 15
- C. CARLET, ``On
Z4-duality'', IEEE Transaction on Information Theory
41, 5, 1995, p. 1487-1495.
- 16
- H. CHABANNE,
``Factorizing of xn-1 and orthogonalization over
finite fields of characteristic 2'', AAECC 6, 1, 1995,
p. 57-63.
- 17
- P. CHARPIN,
V. ZINOVIEV, ``On
coset weight distributions of the 3-error-correcting
BCH-codes'', SIAM Journal of Discrete Mathematics,
1996, A paraître. Rapport INRIA N. 2828.
- 18
- P. CHARPIN,
``Self-dual codes which are principal ideals of the group
algebra
F2[{F2m,+}],
The Journal of Statistical Planning and Inference Special
volume : Affine Designs, Orthogonal Arrays and Related
Topics, 1996, A paraître. Rapport INRIA N. 2325.
- 19
- G. HACHé,
D. LE BRIGAND, ``Effective construction of
algebraic geometry codes'', IEEE Transaction on Information
Theory 41, Numéro spécial : Algebraic Geometry Codes, 6,
1996, p. 1615-1628.
- 20
- F. LAUBIE,
A. MOVAHHEDI,
``Substitutions de séries formelles et cyclotomie'',
Journal of Number Theory, 58, 1996,
p. 253-266.
- 21
- F. LAUBIE,
M. SAîNE, ``Ramification of automorphisms
of k(t))'', Journal of Number Theory,
1996, A paraître.
- 22
- D. LE
BRIGAND, ``Classification
of algebraic function fields with divisor class number two'',
Finite Fields and Their Applications, 2, 1996,
p. 153-172.
- 23
- D. LE
BRIGAND, ``Quadratic
algebraic function fields with ideal class number two'',
Arithmetic, Geometry and Coding Theory, W. de Gruyter,
1996, p. 105-126.
- 24
- F. LEVY-DIT-VEHEL, S. LITSYN, ``More on the covering radius
of BCH codes'', IEEE Transaction on Information Theory
42, 3, mai 1996.
- 25
- N. SENDRIER,
``On the dimension of the hull'', SIAM Journal on Applied
Mathematics, 1996, A paraître.
- Communications à
congrès
- 26
- D. AUGOT,
F. FONTAINE,
``Protection des droits et marquage d'image'', in:
Electronic Imaging and The Visual Arts (EVA"96), Paris,
France, décembre 1996.
- 27
- D. AUGOT,
``Computing Groebner bases for finding codewords of small
weight'', in: The 2nd IMACS Conference on Applications of
Computer Algebra, RISC Linz, Autriche, 17-20 juillet
1996.
- 28
- T. BERGER,
P. CHARPIN,
``Permutation group of some affine-invariant codes over
extension fields'', in: Fifth International Workshop on
Algebraic and Combinatorial Coding Theory (ACCT-5),
Sozopol, Bulgarie, 1-7 juin 1996.
- 29
- T. BERGER, ``The
automorphism group and the permutation group of
affine-invariant codes'', in: Finite Fields and their
Applications, edited by S. Cohen
H. Niederreiter (réd.), London Math. Society, Lecture
Note 233, p. 32-45, 1996.
- 30
- F. BLANCHET,
G. BOMMIER,
``Quasi-cyclic Goppa codes'', in: Algebraic and
Combinatorial Coding Theory, 5, Institute of
Mathematics and Informatics, Bulgarian Academy of Sciences,
UNICORN, p. 37-43, juin 1996.
- 31
- P. CAMION,
A. CANTEAUT,
``Construction of t-resilient functions over a finite
alphabet'', in: Advances in Cryptology - EUROCRYPT'96,
U. Maurer (réd.), Lecture Notes in Computer
Science, 1070, Springer-Verlag, p. 283-293,
1996.
- 32
- P. CAMION,
A. CANTEAUT,
``Generalization of Siegenthaler inequality and
Schnorr-Vaudenay multipermutations'', in: Advances in
Cryptology - CRYPTO'96, N. Koblitz (réd.),
Lecture Notes in Computer Science, 1109,
Springer-Verlag, p. 372-386, 1996.
- 33
- A. CANTEAUT, ``A
new algorithm for finding minimum-weight words in large linear
codes'', in: Cryptography and Coding - 5th IMA
Conference, C. Boyd (réd.), Lecture Notes in
Computer Science, 1025, Springer-Verlag, p. 205-212,
1995.
- 34
- A. CANTEAUT,
``True minimum distance of some narrow-sense BCH codes of
length 511'', in: Mediterranean Workshop on Coding and
Information Integrity, Palma-de-Majorque, Espagne, février
1996.
- 35
- C. CARLET, ``A
characterization of binary bent functions'', in: Fifth
International Workshop on Algebraic and Combinatorial Coding
Theory (ACCT-5), Sozopol, Bulgarie, 1-7 juin 1996.
- 36
- C. CARLET, ``A
construction of bent functions'', in: Finite Fields and
their Applications, edited by S. Cohen
H. Niederreiter (réd.), London Math. Society, Lecture
Note 233, 1996.
- 37
- C. CARLET,
``Hyper-bent functions'', in: Mediterranean Workshop on
Coding and Information Integrity, Palma-de-Majorque,
Espagne, février 1996.
- 38
- C. CARLET,
``Hyperbent functions'', in: Actes de Pragocrypt'96, Czech
Technical University Publishing House, p. 145-155,
Prague, 1996.
- 39
- P. CHARPIN,
A. TIETAVAINEN,
V. ZINOVIEV, ``On
binary cyclic codes with minimum distance three'', in:
Fifth International Workshop on Algebraic and Combinatorial
Coding Theory (ACCT-5), Sozopol, Bulgarie, 1-7 juin
1996.
- 40
- C. FONTAINE,
``The nonlinearity of a class of boolean functions with short
representation'', in: Actes de Pragocrypt'96, Czech
Technical University Publishing House, p. 129-144,
Prague, 1996.
- 41
- G. HACHé,
``Computation in algebraic function fields for effective
construction of algebraic geometric codes'', in: AAECC
11, Lecture Notes in Computer Science, 948,
Springer-Verlag, p. 283-293, 1996.
- 42
- G. HACHé,
``PAFF: An axiom package for algebraic function field in one
variable'', in: Geometry, Algorithmic and Arithmetic in the
Theory of Error Correcting Codes, Pointe à Pitre,
Guadeloupe, 1-5 avril 1996.
- 43
- D. LE
BRIGAND, ``Class-numbers
in function fields: historic point of view and an open
problem'', in: Geometry, Algorithmic and Arithmetic in the
Theory of Error Correcting Codes, Pointe à Pitre,
Guadeloupe, 1-5 avril 1996.
- 44
- N. SENDRIER,
``Efficient generation of binary words of given weight'',
in: Cryptography and Coding - 5th IMA Conference,
C. Boyd (réd.), Lecture Notes in Computer
Science, 1025, Springer-Verlag, p. 184-187,
1995.
- Rapports de
recherche
- 45
- P. CAMION,
A. CANTEAUT,
``Construction of t-resilient functions over a finite
alphabet'', rapport de recherche n°RR-2789, INRIA,
février 1996.
- 46
- A. CANTEAUT,
F. CHABAUD, ``A new
algorithm for finding minimum-weight words in a linear code:
application to primitive narrow-sense BCH codes of
length 511'', rapport de recherche n°RR-2685,
INRIA, octobre 1995.
- 47
- P. CHARPIN,
V. ZINOVIEV, ``On
coset weight distributions of the 3-error-correcting
BCH-codes'', rapport de recherche n°RR-2828, INRIA,
mars 1996.
- 48
- P. CHARPIN,
``Tools for coset weight enumerators of some codes'',
rapport de recherche n°RR-2640, INRIA, août 1995.
- 49
- F. LAUBIE,
``Introduction to the theory of Nim-linear codes'', rapport
de recherche n°RR-2736, INRIA, novembre 1995.
- 50
- N. SENDRIER,
``Un algorithme pour trouver la permutation entre deux codes
binaires équivalents'', Rapport de Recherche n°2853,
INRIA, Avril 1996.
- 51
- V. ZINOVIEV,
``On the solution of equations of degree
over finite fields GF(2m), rapport
de recherche n°RR-2829, INRIA, janvier 1996.
- Divers
- 52
- E. ASSMUS,
``Linearly derived Steiner triple systems'', 1995, Soumis pour
publication.
- 53
- P. CHARPIN,
A. TIETAVAINEN,
V. ZINOVIEV, ``On
binary cyclic codes with d=3'', 1996, Soumis pour
publication.
- 54
- F. LAUBIE,
``Linear ternary Greedy codes'', 1996, Soumis pour
publication.
- 55
- F. LAUBIE,
``Ramification des polynômes de Chebyshev'', 1996, Soumis pour
publication.
- 56
- N. SENDRIER,
``On the structure of a randomly permuted concatenated code'',
Soumis pour publication.