Algebraic Algorithms and Error-Correcting Codes
Springer Berlin (Verlag)
978-3-540-16776-1 (ISBN)
On the arithmetics of Galoisfields and the like.- On strongly tactical codes.- Integer programming applied to eigenvector computation in a class of Markov processes.- A minimum system of generators for extended cyclic codes which are invariant under the affine group.- Some algebraic tools for error-correcting codes.- On computing the performance probabilities of Reed-Solomon codes.- Numerical experiments related to the covering radius of some first order Reed-Muller codes.- Several aspects of problems encountered in coding applications.- Software simulation of data transmission using error-correcting codes, through an awgn channel.- Algebraic methods for constructing asymmetric cryptosystems.- Covering radii of even subcodes of t-dense codes.- Orthogonal transform encoding of cyclic codes.- On s-sum-sets and projective codes.- Pseudo-triple-sum-sets and association schemes.- A decoding algorithm for linear codes.- The finite Fourier-transform and theta functions.- Recent results on coding and algebraic geometry.- Some properties of elliptic codes over a field of characteristic 2.- Self-dual codes 2n circulant over Fq (q=2r).- Automorphisms and isometries of some modular algebras.- A lower bound for the bilinear complexity of some semisimple lie algebras.- On computational complexity of some algebraic curves over finite fields.- Some group presentations and enforcing the associative law.- Fast computation of linear finite-dimensional operators over arbitrary rings.- Quantifier elimination for real closed fields.- Efficient decision algorithms for locally finite theories.- The algorithmic structure of $$mathfrak{s}mathfrak{l}(2,k)$$ .- Optimal algorithms for finite dimensional simply generated algebras.- On a little but useful algorithm.- Computation of independentunits in number fields by Dirichlet's method.- Some upper bounds for the multiplicity of an autoreduced subset of N m and their applications.- Exact computation of the characteristic polynomial of an integer matrix.- An analysis of the Krönecker algorithm for factorization of algebraic polynomials.- Polynomial factorization over ?[X].- The L-machine: An attempt at parallel hardware for symbolic computation.- An interactive graphical interface for symbolic algebra systems.- Groebner bases for non-commutative polynomial rings.- Extending the binary GCD algorithm.- Integration of rational functions in SAC-2.- Heuristic bivariate lifting.- Optimal evaluation of algebraic expressions.- On deleting links in semantic graphs.- Erratum.
| Erscheint lt. Verlag | 1.7.1986 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | VII, 417 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 680 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Technik ► Elektrotechnik / Energietechnik | |
| Technik ► Nachrichtentechnik | |
| Schlagworte | algorithm • Algorithm analysis and problem complexity • Algorithmen • algorithms • Codierung • Codierung / Kodierung • Complexity • Computeralgebra • Data Transmission • Fehlererkennung • Fehlererkennung / Troubleshooting • Generator • Hardware • programming • Simulation • Software • Symbol |
| ISBN-10 | 3-540-16776-5 / 3540167765 |
| ISBN-13 | 978-3-540-16776-1 / 9783540167761 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
