|
" Applied algebra, algorithmics and error-correcting codes : "
edited by Alain Poli.
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
745338
|
| Doc. No
|
:
|
b565287
|
| Main Entry
|
:
|
edited by Alain Poli.
|
| Title & Author
|
:
|
Applied algebra, algorithmics and error-correcting codes : : 2nd International Conference, AAECC-2, Toulouse, France, October 1-5, 1984 : proceedings\ edited by Alain Poli.
|
| Publication Statement
|
:
|
Berlin ; New York : Springer-Verlag, ©1986.
|
| Series Statement
|
:
|
Lecture notes in computer science, 228.
|
| Page. NO
|
:
|
(vi, 265 pages) : illustrations
|
| ISBN
|
:
|
3540388133
|
|
|
:
|
: 9783540388135
|
| Contents
|
:
|
On associative algebras of minimal rank --; Construction of primitive idempotents for a variable codes --; Multivariate polynomials in coding theory --; Enumeration of self dual 2k circulant codes --; Codes, groups and invariants --; On a conjecture concerning coverings of Hamming space --; An improved upper bound on covering radius --; Association schemes and difference sets defined on two weight codes --; Automorphisms of two families of extended non binary cyclic Goppa Codes --; Some quasi-perfect cyclic codes --; Explicit Kerdock codes over GF(2) --; Une classe de codes 2-correcteurs adaptes aux systems d'information formates --; LOUSTICC simulation software : Experimental results of coding systems --; An algorithm of complete decoding of double-error-correcting goppa codes --; On the number of divisors of a polynomial over GF(2) --; Multivariate polynomial factoring and detection of true factors --; Discriminants and the irreducibility of a class of polynomials --; Computational aspects of reduction strategies to construct resolutions of monomial ideals --; Designs arising from symplectic geometry --; Distance --; transitive graphs and the problem of maximal subgroups of symmetric groups --; Can a fast signature scheme without secret key be secure / Un Schema de Signature Courte et Rapide N'Utilisant pas de CLE Secrete Peut-IL Etre Fiable? --; Manipulation of recurrence relations in computer algebra --; Some design principles for a mathematical knowledge representation system: A new approach to scientific calculation.
|
| Subject
|
:
|
Algebra -- Data processing -- Congresses.
|
| Subject
|
:
|
Computer algorithms -- Congresses.
|
| Subject
|
:
|
Error-correcting codes (Information theory) -- Congresses.
|
| LC Classification
|
:
|
QA268.E358 1986
|
| Added Entry
|
:
|
Alain Poli
|
| |