Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 5th International Conference, AAECC-5, Menorca, Spain, June 15-19, 1987. Proceedings: Lecture Notes in Computer Science, cartea 356
Editat de Llorenc Huguet, Alain Polien Limba Engleză Paperback – 14 iun 1989
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 338.81 lei
Preț vechi: 423.52 lei
-20% Nou
Puncte Express: 508
Preț estimativ în valută:
64.83€ • 67.86$ • 53.96£
64.83€ • 67.86$ • 53.96£
Carte tipărită la comandă
Livrare economică 31 martie-14 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540510826
ISBN-10: 3540510826
Pagini: 428
Ilustrații: VIII, 420 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540510826
Pagini: 428
Ilustrații: VIII, 420 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Non simple tournaments : Theoretical properties and a polynomial algorithm.- Covering radius for codes obtained from T(m) triangular graphs.- Searching for weakly autocorrelated binary sequences.- On the prefixes of a random trace and the membership problem for context-free trace languages.- On decoding binary quadratic residue codes.- Pseudometrics associated with fuzzy relations having weak properties.- Towards an expert system for error correcting codes: SECC.- An Iterative Euclidean Algorithm.- Gröbner bases and differential algebra.- A procedure to prove geometrical statements.- Some applications of a classification of affine-invariant codes.- On the computation of the local and global analytic branches of a real algebraic curve.- Distribution of codewords and decoding error rate in rs codes with application to performance evaluation from optical disc.- On generalized minimum distance decoding.- Newton symmetric functions and the arithmetic of algebraically closed fields.- Non linear covering codes : A few results and conjectures.- Grobner bases, Ritt's algorithm and decision procedures for algebraic theories.- An algebraic model for the storage of data in parallel memories.- Algebrric solution of systems of polynomirl equations using Groebher bases.- How to decide whether a polynomial ideal is primary or not.- On the computational complexity of polynomials and bilinear mappings. A survey.- Coding theory and its applications in Japan.- Binary sequences with good correlation properties.- Hankel matrices and polynomials.- On the (d,D,D,s)-digraph problem.- It is decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent thue system is torsion-free.- A shift-remainder GCD algorithm.- New class of cyclic, random and burst errorcorrecting codes.- A conjecture on the free distance of (2,1,m) binary convolutional codes.- On the construction of completely regular linear codes from distance — Regular graphs.- Synthesis of two-dimensional linear feedback shift registers and Groebner bases.- Constructing universal Gröbner bases.