HOME > Detail View

Detail View

Applied algebra, algebraic algorithms and error-correcting codes : 11th international symposium, AAECC-11, Paris, France, July 1995 : proceedings

Applied algebra, algebraic algorithms and error-correcting codes : 11th international symposium, AAECC-11, Paris, France, July 1995 : proceedings

Material type
단행본
Personal Author
Cohen, G. (Gerard), 1951-. Giusti, Marc. Mora, Teo.
Title Statement
Applied algebra, algebraic algorithms and error-correcting codes : 11th international symposium, AAECC-11, Paris, France, July 1995 : proceedings / Gerard Cohen, Marc Giusti, Teo Mora (eds.).
Publication, Distribution, etc
Berlin ;   New York :   Springer-Verlag,   c1995.  
Physical Medium
xi, 484 p. : ill. ; 24 cm.
Series Statement
Lecture notes in computer science,0302-9743 ; 948
ISBN
3540601147 (pbk. : alk. paper) 9783540601142 (pbk. : alk. paper)
Bibliography, Etc. Note
Includes bibliographical references and index.
Subject Added Entry-Topical Term
Error-correcting codes (Information theory) -- Congresses. Algebra -- Data processing -- Congresses. Algorithms -- Congresses.
000 01544camuu2200373 a 4500
001 000000922340
005 20091125153358
008 950622s1995 gw a b 101 0 eng
010 ▼a 95021560
020 ▼a 3540601147 (pbk. : alk. paper)
020 ▼a 9783540601142 (pbk. : alk. paper)
035 ▼a (OCoLC)ocm32821164
035 ▼a (OCoLC)32821164
035 ▼a (KERIS)REF000014736046
040 ▼a DLC ▼c DLC ▼d DLC ▼d 211009
050 0 0 ▼a QA268 ▼b .A35 1995
082 0 4 ▼a 005.7/2 ▼2 22
090 ▼a 005.72 ▼b A111a ▼c 1995
111 2 ▼a AAECC-11 ▼d (1995 : ▼c Paris, France)
245 1 0 ▼a Applied algebra, algebraic algorithms and error-correcting codes : ▼b 11th international symposium, AAECC-11, Paris, France, July 1995 : proceedings / ▼c Gerard Cohen, Marc Giusti, Teo Mora (eds.).
246 3 0 ▼a AAECC-11
260 ▼a Berlin ; ▼a New York : ▼b Springer-Verlag, ▼c c1995.
300 ▼a xi, 484 p. : ▼b ill. ; ▼c 24 cm.
490 1 ▼a Lecture notes in computer science, ▼x 0302-9743 ; ▼v 948
504 ▼a Includes bibliographical references and index.
650 0 ▼a Error-correcting codes (Information theory) ▼v Congresses.
650 0 ▼a Algebra ▼x Data processing ▼v Congresses.
650 0 ▼a Algorithms ▼v Congresses.
700 1 ▼a Cohen, G. ▼q (Gerard), ▼d 1951-.
700 1 ▼a Giusti, Marc.
700 1 ▼a Mora, Teo.
830 0 ▼a Lecture notes in computer science ; ▼v 948.

No. Location Call Number Accession No. Availability Due Date Make a Reservation Service
No. 1 Location Science & Engineering Library/Sci-Info(Stacks2)/ Call Number 005.72 A111a 1995 Accession No. 121186565 Availability Available Due Date Make a Reservation Service B M
No. 2 Location Sejong Academic Information Center/Science & Technology/ Call Number 005.72 A111a 1995 Accession No. 151033008 Availability Available Due Date Make a Reservation Service
No. Location Call Number Accession No. Availability Due Date Make a Reservation Service
No. 1 Location Science & Engineering Library/Sci-Info(Stacks2)/ Call Number 005.72 A111a 1995 Accession No. 121186565 Availability Available Due Date Make a Reservation Service B M
No. Location Call Number Accession No. Availability Due Date Make a Reservation Service
No. 1 Location Sejong Academic Information Center/Science & Technology/ Call Number 005.72 A111a 1995 Accession No. 151033008 Availability Available Due Date Make a Reservation Service

Contents information

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 Grobner 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 by algebraic 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.


Information Provided By: : Aladin

New Arrivals Books in Related Fields