دانلود کتاب Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 5th International Conference, AAECC-5 Menorca, Spain, June 15–19, 1987 Proceedings

فهرست مطالب :

Non simple tournaments : Theoretical properties and a polynomial algorithm....Pages 1-15
Covering radius for codes obtained from T(m) triangular graphs....Pages 16-24
Searching for weakly autocorrelated binary sequences....Pages 25-34
On the prefixes of a random trace and the membership problem for context-free trace languages....Pages 35-59
On decoding binary quadratic residue codes....Pages 60-68
Pseudometrics associated with fuzzy relations having weak properties....Pages 69-74
Towards an expert system for error correcting codes: SECC....Pages 75-87
An Iterative Euclidean Algorithm....Pages 88-128
Gröbner bases and differential algebra....Pages 129-140
A procedure to prove geometrical statements....Pages 141-150
Some applications of a classification of affine-invariant codes....Pages 151-160
On the computation of the local and global analytic branches of a real algebraic curve....Pages 161-181
Distribution of codewords and decoding error rate in rs codes with application to performance evaluation from optical disc....Pages 182-201
On generalized minimum distance decoding....Pages 202-215
Newton symmetric functions and the arithmetic of algebraically closed fields....Pages 216-224
Non linear covering codes : A few results and conjectures....Pages 225-229
Grobner bases, Ritt's algorithm and decision procedures for algebraic theories....Pages 230-237
An algebraic model for the storage of data in parallel memories....Pages 238-246
Algebrric solution of systems of polynomirl equations using Groebher bases....Pages 247-257
How to decide whether a polynomial ideal is primary or not....Pages 258-268
On the computational complexity of polynomials and bilinear mappings. A survey....Pages 269-300
Coding theory and its applications in Japan....Pages 301-305
Binary sequences with good correlation properties....Pages 306-320
Hankel matrices and polynomials....Pages 321-333
On the (d,D,D,s)-digraph problem....Pages 334-340
It is decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent thue system is torsion-free....Pages 341-349
A shift-remainder GCD algorithm....Pages 350-356
New class of cyclic, random and burst error correcting codes....Pages 357-368
A conjecture on the free distance of (2,1,m) binary convolutional codes....Pages 369-375
On the construction of completely regular linear codes from distance — Regular graphs....Pages 376-393
Synthesis of two-dimensional linear feedback shift registers and Groebner bases....Pages 394-407
Constructing universal Gröbner bases....Pages 408-417