2. AAECC 1984: Toulouse, France
Alain Poli (Ed.):
Applied Algebra, Algorithms and Error-Correcting Codes, 2nd International Conference, AAECC-2, Toulouse, France, October 1-5, 1984, Proceedings.
Lecture Notes in Computer Science 228 Springer 1986, ISBN 3-540-16767-6 
- Joos Heintz, Jacques Morgenstern:
On associative algebras of minimal rank.
1-24
- Alain Poli:
Construction of primitive idempotents for n variable codes.
25-35
- Hideki Imai:
Multivariate polynomials in coding theory.
36-60
- Alain Poli, C. Rigoni:
Enumeration of self dual 2k circulant codes.
61-70
- Thomas Beth:
Codes, groups and invariants.
71-78
- Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane:
On a conjecture concerning coverings of Hamming space.
79-89
- H. F. Mattson Jr.:
An improved upper bound on covering radius.
90-106
- Llorenç Huguet i Rotger, Mercè Griera:
Association schemes and difference sets defined on two weight codes.
107-111
- J. A. Thiong-Ly:
Automorphisms of two families of extended non binary cyclic Goppa codes.
112-121
- Jean-Louis Dornstetter:
Some quasi-perfect cyclic codes.
122-129
- Douglas A. Leonard, C. A. Rodger:
Explicit Kerdock codes over GF(2).
130-135
- Bernard Courteau, Jean Goulet:
Une classe de codes 2-correcteurs adaptés aux systèmes d'information.
136-144
- M. C. Gennero:
Lousticc simulation software: experimental results of coding systems.
145-153
- Gui Liang Feng, Kenneth K. Tzeng:
An algorithm of complete decoding of double-error-correcting Goppa codes.
154-160
- Philippe Piret:
On the number of divisors of a polynomial over GF(2).
161-168
- Denis Lugiez:
Multivariate polynomial factoring and detection of true factors.
169-177
- Oscar Moreno de Ayala:
Discriminants and the irreducibility of a class of polynomials.
178-181
- H. Michael Möller, Ferdinando Mora:
Computational aspects of reduction strategies to construct resolutions of monomial ideals.
182-197
- Lucien Bénéteau, Jacqueline Lacaze:
Designs arising from symplectic geometry.
198-205
- Annie Astié-Vidal, J. Chifflet:
Distance-transitive graphs and the problem of maximal subgroups of symmetric groups.
206-214
- Paul Camion:
Can a fast signature scheme without secret key be secure?.
215-241
- Jacques Calmet:
Manipulation of recurrence relations in computer algebra.
242-252
- Jacques Calmet, Marc Bergman:
Some design principles for a mathematical knowledge representation system: a new approach to scientific calculation.
253-265
Last update Tue Feb 14 03:47:02 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
