Algebraic Algorithms and Error-Correcting Codes
Editat de Jaques Calmeten Limba Engleză Paperback – iul 1986
Preț: 384.12 lei
Puncte Express: 576
Carte tipărită la comandă
Livrare economică 07-21 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540167761
ISBN-10: 3540167765
Pagini: 432
Ilustrații: VII, 417 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.65 kg
Ediția:1986
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540167765
Pagini: 432
Ilustrații: VII, 417 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.65 kg
Ediția:1986
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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 independentunits 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.