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.
Author(s): L. A. Bassalygo (auth.), Gérard Cohen, Marc Giusti, Teo Mora (eds.)
Series: Lecture Notes in Computer Science 948
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1995
Language: English
Pages: 484
Tags: Data Encryption; Coding and Information Theory; Symbolic and Algebraic Manipulation; Combinatorics; Algorithm Analysis and Problem Complexity
Supports of a code....Pages 1-3
Chemical isomerism, a challenge for algebraic combinatorics and for computer science....Pages 4-20
On algebraic methods in covering radius problems....Pages 21-32
How lower and upper complexity bounds meet in elimination theory....Pages 33-69
Bivariate polynomial multiplication patterns....Pages 70-81
Division of entire functions by polynomial ideals....Pages 82-95
Variations on minimal codewords in linear codes....Pages 96-105
On the computation of the radical of polynomial complete intersection ideals....Pages 106-119
Which families of long binary linear codes have a binomial weight distribution?....Pages 120-130
The discovery of simple 7-designs with automorphism group PΓL (2, 32)....Pages 131-145
Fast exponentation in cryptography....Pages 146-157
On maximal spherical codes I....Pages 158-168
Formal computation of Galois groups with relative resolvents....Pages 169-182
A case of automatic theorem proving in Euclidean geometry: the Maclane 8 3 theorem....Pages 183-193
Isometry classes of indecomposable linear codes....Pages 194-204
When polynomial equation systems can be “solved” fast?....Pages 205-231
Using symmetric functions to describe the solution set of a zero dimensional ideal....Pages 232-247
Triangular systems and factorized Gröbner bases....Pages 248-261
Computation in algebraic function fields for effective construction of algebraic-geometric codes....Pages 262-278
Singly-even self-dual codes and Hadamard matrices....Pages 279-284
Implicitization of curves parameterized by generalized trigonometric polynomials....Pages 285-296
Randomness properties of partial γ - β planes as LSI test inputs and their implementations....Pages 297-311
Mixed covering codes with two binary and four ternary coordinates....Pages 312-322
About approximations of exponentials....Pages 323-333
A note on normal bases....Pages 334-340
On the covering radius of long Goppa codes....Pages 341-346
Integration of multivariate rational functions given by straight-line programs....Pages 347-364
Polynomial gcd computations over towers of algebraic extensions....Pages 365-382
Displacements of matrix products....Pages 383-392
Testing identities of series defined by algebraic partial differential equations....Pages 393-407
The complexity of formal resolution of linear partial differential equations....Pages 408-414
A fast parallel implementation of the Berlekamp-Massey algorithm with a 1D systolic array architecture....Pages 415-426
Tomography of constructible functions....Pages 427-435
On the determination of formal solutions of a system of partial differential equations....Pages 436-447
D 4 , E 6 , E 8 and the AGM....Pages 448-455
Computation of the Galois groups of the resolvent factors for the direct and inverse Galois problems....Pages 456-468
First integrals and Darboux polynomials of homogeneous linear differential systems....Pages 469-484
