{"product_id":"algebraic-algorithms-and-error-correcting-codes-3rd-international-conference-aaecc-3-grenoble-france-july-15-19-1985-proceedings-von-jaques-calmet-hrsg","title":"Algebraic Algorithms and Error-Correcting Codes","description":"\u003cp\u003eOn 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     $$\\mathfrak{s}\\mathfrak{l}(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.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783540167761\"\u003e\u003ch3\u003e3rd International Conference, AAECC-3, Grenoble, France, July 15-19, 1985. Proceedings\u003c\/h3\u003e\u003c\/div\u003e","brand":"Libri","offers":[{"title":"Softcover - 9783540167761","offer_id":39435712888925,"sku":"9783540167761","price":53.49,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/d76c6b34-2448-4fff-a333-2f42cdc76da3.jpg?v=1773554266","url":"https:\/\/shop.autorenwelt.de\/products\/algebraic-algorithms-and-error-correcting-codes-3rd-international-conference-aaecc-3-grenoble-france-july-15-19-1985-proceedings-von-jaques-calmet-hrsg","provider":"Autorenwelt Shop","version":"1.0","type":"link"}