---

＜電子ブック＞
Algebraic Algorithms and Error-Correcting Codes : 3rd International Conference, AAECC-3, Grenoble, France, July 15-19, 1985. Proceedings / edited by Jaques Calmet
(Lecture Notes in Computer Science. ISSN:16113349 ; 229)

版	1st ed. 1986.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1986
本文言語	英語
大きさ	VII, 417 p : online resource
著者標目	Calmet, Jaques editor SpringerLink (Online service)
件　名	LCSH:Electrical engineering LCSH:Telecommunication LCSH:Algorithms FREE:Electrical and Electronic Engineering FREE:Communications Engineering, Networks FREE:Algorithms
一般注記	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 $$\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 HTTP:URL=https://doi.org/10.1007/3-540-16776-5

 類似資料