LEADER 06280nam 22007935 450 001 996466132903316 005 20200702104419.0 010 $a3-540-49440-5 024 7 $a10.1007/3-540-60114-7 035 $a(CKB)1000000000234304 035 $a(SSID)ssj0000321345 035 $a(PQKBManifestationID)11212669 035 $a(PQKBTitleCode)TC0000321345 035 $a(PQKBWorkID)10281669 035 $a(PQKB)10490274 035 $a(DE-He213)978-3-540-49440-9 035 $a(PPN)155223720 035 $a(EXLCZ)991000000000234304 100 $a20121227d1995 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApplied Algebra, Algebraic Algorithms and Error-Correcting Codes$b[electronic resource] $e11th International Symposium, AAECC-11, Paris, France, July 17-22, 1995. Proceedings /$fedited by Gerard Cohen, Marc Giusti, Teo Mora 205 $a1st ed. 1995. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1995. 215 $a1 online resource (XI, 484 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v948 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-60114-7 327 $aSupports 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 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. 330 $aThis 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v948 606 $aComputers 606 $aComputer security 606 $aData encryption (Computer science) 606 $aCoding theory 606 $aInformation theory 606 $aComputer science?Mathematics 606 $aCombinatorics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSystems and Data Security$3https://scigraph.springernature.com/ontologies/product-market-codes/I28060 606 $aCryptology$3https://scigraph.springernature.com/ontologies/product-market-codes/I28020 606 $aCoding and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15041 606 $aSymbolic and Algebraic Manipulation$3https://scigraph.springernature.com/ontologies/product-market-codes/I17052 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aComputers. 615 0$aComputer security. 615 0$aData encryption (Computer science). 615 0$aCoding theory. 615 0$aInformation theory. 615 0$aComputer science?Mathematics. 615 0$aCombinatorics. 615 14$aTheory of Computation. 615 24$aSystems and Data Security. 615 24$aCryptology. 615 24$aCoding and Information Theory. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aCombinatorics. 676 $a005.7/2 702 $aCohen$b Gerard$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aGiusti$b Marc$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMora$b Teo$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aAAECC-11 906 $aBOOK 912 $a996466132903316 996 $aApplied Algebra, Algebraic Algorithms and Error-Correcting Codes$9772419 997 $aUNISA