Applied Algebra, Algorithmics and Error-Correcting Codes: 2nd International Conference, AAECC-2 Toulouse, France, October 1–5, 1984 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Joos Heintz (auth.), Alain Poli (eds.)
Series: Lecture Notes in Computer Science 228
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1986

Language: English-French
Pages: 268
Tags: Algorithm Analysis and Problem Complexity; Coding and Information Theory

On associative algebras of minimal rank....Pages 1-24
Construction of primitive idempotents for a variable codes....Pages 25-35
Multivariate polynomials in coding theory....Pages 36-60
Enumeration of self dual 2k circulant codes....Pages 61-70
Codes, groups and invariants....Pages 71-78
On a conjecture concerning coverings of Hamming space....Pages 79-89
An improved upper bound on covering radius....Pages 90-106
Association schemes and difference sets defined on two weight codes....Pages 107-111
Automorphisms of two families of extended non binary cyclic Goppa Codes....Pages 112-121
Some quasi-perfect cyclic codes....Pages 122-129
Explicit Kerdock codes over GF(2)....Pages 130-135
Une classe de codes 2-correcteurs adaptes aux systems d'information formates....Pages 136-144
LOUSTICC simulation software : Experimental results of coding systems....Pages 145-153
An algorithm of complete decoding of double-error-correcting goppa codes....Pages 154-160
On the number of divisors of a polynomial over GF(2)....Pages 161-168
Multivariate polynomial factoring and detection of true factors....Pages 169-177
Discriminants and the irreducibility of a class of polynomials....Pages 178-181
Computational aspects of reduction strategies to construct resolutions of monomial ideals....Pages 182-197
Designs arising from symplectic geometry....Pages 198-205
Distance — transitive graphs and the problem of maximal subgroups of symmetric groups....Pages 206-214
Can a fast signature scheme without secret key be secure....Pages 215-241
Manipulation of recurrence relations in computer algebra....Pages 242-252
Some design principles for a mathematical knowledge representation system: A new approach to scientific calculation....Pages 253-265