000 04281nam a22004695i 4500
001 978-3-540-39855-4
003 DE-He213
005 20160624101946.0
007 cr nn 008mamaa
008 121227s1986 gw | s |||| 0|eng d
020 _a9783540398554
_9978-3-540-39855-4
024 7 _a10.1007/3-540-16776-5
_2doi
050 4 _aTK1-9971
072 7 _aTJK
_2bicssc
072 7 _aTEC041000
_2bisacsh
082 0 4 _a621.382
_223
245 1 0 _aAlgebraic Algorithms and Error-Correcting Codes
_h[electronic resource] :
_b3rd International Conference, AAECC-3 Grenoble, France, July 15–19, 1985 Proceedings /
_cedited by Jacques Calmet.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1986.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1986.
300 _aVII, 417 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v229
505 0 _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 $$\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.
650 0 _aEngineering.
650 0 _aComputer software.
650 0 _aTelecommunication.
650 1 4 _aEngineering.
650 2 4 _aCommunications Engineering, Networks.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
700 1 _aCalmet, Jacques.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540167761
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v229
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-16776-5
942 _2EBK4735
_cEBK
999 _c34029
_d34029