Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 11th International Symposium, AAECC-11, Paris, France, July 17-22, 1995. Proceedings

by Gerard Cohen (Editor), Marc Giusti (Editor), Teo Mora (Editor)

Overview

This book constitutes the proceedings of the 11th International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-11, held in Paris, France in July 1995.

The volume presents five invited papers and 32 full revised research papers selected from a total of 68 submissions; it is focussed on research directed to the exploitation of algebraic techniques and methodologies for the application in coding and computer algebra. Among the topics covered are coding, cryptoloy, communication, factorization of polynomials, Gröbner bases, computer algebra, algebraic algorithms, symbolic computation, algebraic manipulation.

Product Details

ISBN-13:	9783540601142
Publisher:	Springer Berlin Heidelberg
Publication date:	08/08/1995
Series:	Lecture Notes in Computer Science , #948
Edition description:	1995
Pages:	484
Product dimensions:	6.10(w) x 9.17(h) x 0.04(d)

Table of Contents

Supports of a code.- Chemical isomerism, a challenge for algebraic combinatorics and for computer science.- On algebraic methods in covering radius problems.- How lower and upper complexity bounds meet in elimination theory.- Bivariate polynomial multiplication patterns.- Division of entire functions by polynomial ideals.- Variations on minimal codewords in linear codes.- On the computation of the radical of polynomial complete intersection ideals.- Which families of long binary linear codes have a binomial weight distribution?.- The discovery of simple 7-designs with automorphism group PΓL(2, 32).- Fast exponentation in cryptography.- On maximal spherical codes I.- Formal computation of Galois groups with relative resolvents.- A case of automatic theorem proving in Euclidean geometry: the Maclane 83 theorem.- Isometry classes of indecomposable linear codes.- When polynomial equation systems can be “solved” fast?.- Using symmetric functions to describe the solution set of a zero dimensional ideal.- Triangular systems and factorized Gröbner bases.- Computation in algebraic function fields for effective construction of algebraic-geometric codes.- Singly-even self-dual codes and Hadamard matrices.- Implicitization of curves parameterized by generalized trigonometric polynomials.- Randomness properties of partial—— planes as LSI test inputs and their implementations.- Mixed covering codes with two binary and four ternary coordinates.- About approximations of exponentials.- A note on normal bases.- On the covering radius of long Goppa codes.- Integration of multivariate rational functions given by straight-line programs.- Polynomial gcd computations over towers of algebraic extensions.- Displacements of matrix products.- Testing identities of series defined byalgebraic partial differential equations.- The complexity of formal resolution of linear partial differential equations.- A fast parallel implementation of the Berlekamp-Massey algorithm with a 1D systolic array architecture.- Tomography of constructible functions.- On the determination of formal solutions of a system of partial differential equations.- D 4, E 6, E 8 and the AGM.- Computation of the Galois groups of the resolvent factors for the direct and inverse Galois problems.- First integrals and Darboux polynomials of homogeneous linear differential systems.