Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 3rd International Conference, AAECC-3, Grenoble, France, July 15-19, 1985. Proceedings / / edited by Jaques Calmet

• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986
• Edizione: 1st ed. 1986.
• Descrizione fisica: 1 online resource (VII, 417 p.)
• Disciplina: 621.3
• Soggetto topico: Electrical engineering; Algorithms; Electrical Engineering; Communications Engineering, Networks; Algorithm Analysis and Problem Complexity
• Persona (resp. second.): CalmetJaques
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di contenuto: On 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.
• Titolo autorizzato: Algebraic algorithms and error-correcting codes
• ISBN: 3-540-39855-4
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996465942603316
• Lo trovi qui: Univ. di Salerno
• Serie: Lecture Notes in Computer Science, . 0302-9743 ; ; 229