Buch, Englisch, Band 356, 420 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1320 g
5th International Conference, AAECC-5, Menorca, Spain, June 15-19, 1987. Proceedings
Buch, Englisch, Band 356, 420 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1320 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-51082-6
Verlag: Springer Berlin Heidelberg
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Informationstheorie, Kodierungstheorie
Weitere Infos & Material
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.