Applied algebra, algebraic algorithms, and error-correcting codes : 11th international symposium, AAECC-11, Paris, France, July 17-22, 1995 : proceedings
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 submis...
Na minha lista:
| Autor Corporativo: | |
|---|---|
| Outros Autores: | , , |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colecção: | Lecture notes in computer science
948 |
| Assuntos: | |
| Acesso em linha: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Applied algebra, algebraic algorithms, and error-correcting codes, 11th international symposium, AAECC-11, Paris, France, July 17-22, 1995, proceedings, Gérard Cohen, Marc Giusti, Teo Mora (eds.), 1995, Berlin, Springer, 1 vol. (XI-484 p.), Lecture notes in computer science, 3-540-60114-7 • Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Texte imprimé, 9783662187159 |
Sumário:
- 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.