Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Springer Berlin (Verlag)
978-3-540-51083-3 (ISBN)
The coding theory of finite geometries and designs.- Recent results on covering problems.- Codes and curves.- Computer and commutative algebra.- The multiplicative complexity of boolean functions.- An algorithm on quasi-ordinary polynomials.- A computer-aided design for sampling a nonlinear analytic system.- Decoding of generalized concatenated codes.- Backtrack searching in the presence of symmetry.- Fast serial-parallel multipliers.- On the complexity of computing class groups of algebraic number fields.- Some new effectivity bounds in computational geometry.- Some remarks on the differential dimension.- On the asymptotic badness of cyclic codes with block-lengths composed from a fixed set of prime factors.- Big numbers p-adic arithmetic: A parallel approach.- Monomial ideals, group algebras and error correcting codes.- Fast integer multiplication by block recursive, number theoretical transforms.- Lambda-Upsilon-Omega: An assistant algorithms analyzer.- Global dimension of associative algebras.- Symmetry and duality in normal basis multiplication.- Multiple error correction with Analog Codes.- On the complexity of satisfiability problems for algebraic structures (preliminary report).- A computational proof of the Noether normalization lemma.- A graphics interface to REDUCE.- Vlsi designs for multiplication over finite fields GF(2m).- A primality test using cyclotomic extensions.- The method of syndrome coding and its application for data compression and processing in high energy physics experiments.- Nonassociative degree five identities not implied by commutativity: A computer approach.- On completely regular propelinear codes.- N-dimensional Berlekamp-Massey algorithm for multiple arrays and construction of multivariate polynomials with preassigned zeros.- Coveringradius: Improving on the sphere-covering bound.- On Goldman's algorithm for solving first-order multinomial autonomous systems.- A covering problem in the odd graphs.- On the computation of Hilbert-Samuel series and multiplicity.- Succinct representations of counting problems.- How to guess ?-th roots modulo n by reducing lattice bases.- A study on Imai-Hirakawa trellis-coded modulation schemes.- Embedding flexible control strategies into object oriented languages.- Majority decoding of large repetition codes for the r-ary symmetric channel.- On binary codes of order 3.- Polynomial decomposition algorithm of almost quadratic complexity.- The weights of the orthogonals of certain cyclic codes or extended GOPPA codes.
| Erscheint lt. Verlag | 23.5.1989 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XII, 488 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 233 mm |
| Gewicht | 878 g |
| Themenwelt | Mathematik / Informatik ► Informatik |
| Mathematik / Informatik ► Mathematik ► Algebra | |
| Schlagworte | Algebra • algorithms • Complexity • Computer • Computeralgebra • Computer Algebra • Computer Science • error-correcting code • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Information • Komplexität • Kryptologie • Symbol |
| ISBN-10 | 3-540-51083-4 / 3540510834 |
| ISBN-13 | 978-3-540-51083-3 / 9783540510833 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
