Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Springer Berlin (Verlag)
978-3-540-51082-6 (ISBN)
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.
Erscheint lt. Verlag | 14.6.1989 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | VIII, 420 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 742 g |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Schlagworte | Algebra • algorithms • coding theory • Complexity • Computer • Computeralgebra • Computer Science • error-correcting code • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Komplexität • Kryptologie • Monoid • Performance • Performance Evaluation |
ISBN-10 | 3-540-51082-6 / 3540510826 |
ISBN-13 | 978-3-540-51082-6 / 9783540510826 |
Zustand | Neuware |
Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich