LEADER 04749nam 22005535 450 001 996465942603316 005 20220919151420.0 010 $a3-540-39855-4 024 7 $a10.1007/3-540-16776-5 035 $a(CKB)1000000000230541 035 $a(SSID)ssj0000321081 035 $a(PQKBManifestationID)11260278 035 $a(PQKBTitleCode)TC0000321081 035 $a(PQKBWorkID)10263071 035 $a(PQKB)11675289 035 $a(DE-He213)978-3-540-39855-4 035 $a(PPN)155215140 035 $a(EXLCZ)991000000000230541 100 $a20121227d1986 u| 0 101 0 $aeng 135 $aurnn#|||mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgebraic Algorithms and Error-Correcting Codes$b[electronic resource] $e3rd International Conference, AAECC-3, Grenoble, France, July 15-19, 1985. Proceedings /$fedited by Jaques Calmet 205 $a1st ed. 1986. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1986. 215 $a1 online resource (VII, 417 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v229 300 $aBibliographic Level Mode of Issuance: Monograph 311 1 $a3-540-16776-5 327 $aOn the arithmetics of Galoisfields and the like -- On strongly tactical codes -- Integer programming applied to eigenvector computation in a class of Markov processes -- A minimum system of generators for extended cyclic codes which are invariant under the affine group -- Some algebraic tools for error-correcting codes -- On computing the performance probabilities of Reed-Solomon codes -- Numerical experiments related to the covering radius of some first order Reed-Muller codes -- Several aspects of problems encountered in coding applications -- Software simulation of data transmission using error-correcting codes, through an awgn channel -- Algebraic methods for constructing asymmetric cryptosystems -- Covering radii of even subcodes of t-dense codes -- Orthogonal transform encoding of cyclic codes -- On s-sum-sets and projective codes -- Pseudo-triple-sum-sets and association schemes -- A decoding algorithm for linear codes -- The finite Fourier-transform and theta functions -- Recent results on coding and algebraic geometry -- Some properties of elliptic codes over a field of characteristic 2 -- Self-dual codes 2n circulant over Fq (q=2r) -- Automorphisms and isometries of some modular algebras -- A lower bound for the bilinear complexity of some semisimple lie algebras -- On computational complexity of some algebraic curves over finite fields -- Some group presentations and enforcing the associative law -- Fast computation of linear finite-dimensional operators over arbitrary rings -- Quantifier elimination for real closed fields -- Efficient decision algorithms for locally finite theories -- The algorithmic structure of sl(2,k) -- Optimal algorithms for finite dimensional simply generated algebras -- On a little but useful algorithm -- Computation of independent units in number fields by Dirichlet's method -- Some upper bounds for the multiplicity of an autoreduced subset of N m and their applications -- Exact computation of the characteristic polynomial of an integer matrix -- An analysis of the Krönecker algorithm for factorization of algebraic polynomials -- Polynomial factorization over ?[X] -- The L-machine: An attempt at parallel hardware for symbolic computation -- An interactive graphical interface for symbolic algebra systems -- Groebner bases for non-commutative polynomial rings -- Extending the binary GCD algorithm -- Integration of rational functions in SAC-2 -- Heuristic bivariate lifting -- Optimal evaluation of algebraic expressions -- On deleting links in semantic graphs -- Erratum. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v229 606 $aElectrical engineering 606 $aAlgorithms 606 $aElectrical Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/T24000 606 $aCommunications Engineering, Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/T24035 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 615 0$aElectrical engineering. 615 0$aAlgorithms. 615 14$aElectrical Engineering. 615 24$aCommunications Engineering, Networks. 615 24$aAlgorithm Analysis and Problem Complexity. 676 $a621.3 702 $aCalmet$b Jaques$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465942603316 996 $aAlgebraic algorithms and error-correcting codes$9878390 997 $aUNISA