Cantitate/Preț
Produs
Total produse
Vezi coșul
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 9th International Symposium, AAECC-9, New Orleans, LA, USA, October 7-11, 1991. Proceedings de Harold F. Mattson

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 9th International Symposium, AAECC-9, New Orleans, LA, USA, October 7-11, 1991. Proceedings: Lecture Notes in Computer Science, cartea 539

Editat de Harold F. Mattson, Teo Mora, T.R.N. Rao
en Limba Engleză Paperback – 25 sep 1991
The AAECC conferences focus on the algebraic aspects ofmodern computer science, which includes the most up-to-dateand advanced topics. The topic of error-correcting codes isone where theory and implementation are unifiedinto asubject both of mathematical beauty and of practicalimportance. Algebraic algorithms are not only interestingtheoretically but also important in computer andcommunication engineering and many other fields.This volume contains the proceedings of the 9th AAECCconference, held in New Orleans, LA, in October 1991.Researchers from Europe, America, Japan and other regions ofthe world presented papers at the conference. The paperspresent new results of recent theoretical andapplication-oriented research in the field.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 40047 lei

Nou

Puncte Express: 601
Preț estimativ în valută:
7664€ • 7980$ • 6477£

Carte tipărită la comandă

Livrare economică 07-21 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540545224
ISBN-10: 3540545220
Pagini: 508
Ilustrații: XII, 496 p.
Dimensiuni: 155 x 233 x 27 mm
Greutate: 0.71 kg
Ediția:1991
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Algorithms for the shape of semialgebraic sets a new approach.- On the parameters of algebraic geometric codes.- On wiedemann's method of solving sparse linear systems.- Fast algorithms for decoding orthogonal and related codes.- Jacobian matrices and constructions in algebra.- Homogenity, pseudo-homogenity, and Gröbner basis computations.- Arithmetic on non supersingular elliptic curves.- Implementing some algorithms of kantor.- Computing roadmaps of general semi-algebraic sets.- An improved sign determination algorithm.- The 2-nd generalized Hamming weight of double-error correcting binary BCH codes and their dual codes.- Buchberger algorithm and integer programming.- New systolic architectures for cyclic code encoding.- Algebraic constructions of efficient broadcast networks.- Error-correction for WIMs and WUMs.- Some constructions in rings of differential polynomials.- Concurrent error detection in sequential circuits using convolutional codes.- An algorithm for the computation of the radical of an ideal in the ring of polynomials.- Integer multiplication in PARSAC-2 on stock microprocessors.- Polynomial-time construction of spherical codes.- Algorithms for a multiple algebraic extension II.- On the orphans and covering radius of the reed-muller codes.- A joint authentication and encryption scheme based on algebraic coding theory.- Arithmetic codes - Survey, recent and new results.- Some results on linear unequal-error-protection codes specified by their generator matrix.- An ackermannian polynomial ideal.- Complexity of the computation of the canonical Whitney stratification of an algebraic set in Cn.- Some undecidability results for weakly confluent monadic string-rewriting systems.- Calculating multidimensional symmetric functions using Jacobi's formula.-Multivariate Sturm theory.- Binary spherical geometric codes.- An algebraic construction of generalized Beenker's codes.- Improving the time complexity of the computation of irreducible and primitive polynomials in finite fields.- Completely transitive codes and distance transitive graphs.- Placement of curved polygons.- On the weights of the elements of the duals of binary BCH codes.- Computation of the openness of some loci of modules.- Random and byte error correcting codes for asymmetric or unidirectional error control.- Finding a minimal polynomial vector set of a vector of nD arrays.- Covering codes and combinatorial optimization.- Decoding of quadrature partial response- trellis coded signals (QPR-TCM) in the presence of intersymbol interference and noise.- On algebraic solutions of linear differential equations with primitive unimodular Galois group.- Error detection and correction in numerical computations.- d-Functions in V k (F 2) and self-decimation of m-sequences.- Multilevel modulation codes for rayleigh fading channels.