Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Editat de Gerard Cohen, Teo Mora, Oscar Morenoen Limba Engleză Paperback – 20 apr 1993
Preț: 380.51 lei
Puncte Express: 571
Carte tipărită la comandă
Livrare economică 08-22 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: 9783540566861
ISBN-10: 3540566864
Pagini: 372
Ilustrații: X, 362 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.56 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540566864
Pagini: 372
Ilustrații: X, 362 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.56 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Sequence based methods for data transmission and source compression.- On the apparent duality of the Kerdock and Preparata codes.- Bounds for codes as solutions of extremum problems for systems of orthogonal polynomials.- Systems of algebraic equations solved by means of endomorphisms.- Criteria for sequence set design in CDMA communications.- Using Groebner bases to determine the algebraic and transcendental nature of field extensions: Return of the killer tag variables.- A “Divide and conquer” algorithm for Hilbert-Poincaré series, multiplicity and dimension of monomial ideals.- An efficient algorithm for the sparse mixed resultant.- Some features of binary block codes for correcting asymmetric errors.- Fixed-parameter complexity and cryptography.- A class of algebraic geometric codes from curves in high-dimensional projective spaces.- A new class of sequences: Mapping sequences.- A zero-test and an interpolation algorithm for the shifted sparse polynomials.- Parallelization of quantifier elimination on a workstation network.- Hyperplane sections of fermat varieties in P 3 in char. 2 and some applications to cyclic codes.- Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems.- Relations among Lie formal series and construction of symplectic integrators.- Exponential sums as discrete fourier transform with invariant phase functions.- Application of finite fields to memory interleaving.- An elementary proof of a partial improvement to the Ax-Katz Theorem.- Energy functions associated with error-correcting codes.- On determining all codes in semi-simple group rings.- On hyperbolic cascaded Reed-Solomon codes.- Peak-shift and bit error-correction with channel side information in runlength-limited sequences.- On athird order differential equation whose differential Galois group is the simple group of 168 elements.- Approximating the number of error locations within a constant ratio is NP-complete.- Two chosen-plaintext attacks on the Li-Wang joint authentication and encryption scheme.- Some constructions of perfect binary codes.