Applied algebra, algebraic algorithms, and error-correcting codes : 9th International Symposium, AAECC-9, New Orleans, LA, USA, October 7-11, 1991 : proceedings

The AAECC conferences focus on the algebraic aspects of modern computer science, which includes the most up-to-date and advanced topics. The topic of error-correcting codes is one where theory and implementation are unifiedinto a subject both of mathematical beauty and of practical importance. Algeb...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Körperschaft: International symposium on Applied algebra, algebraic algorithms, and error-correcting codes :New Orleans
Weitere Verfasser: Mattson, Harold F., 1930- (Verlagsleitung), Mora, Teo, 1951- (Verlagsleitung), Rao, Thammavaram Rudra Narasimha, 1933- (Verlagsleitung)
Format: Livre numérique
Sprache:Anglais
Veröffentlicht: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Schriftenreihe:Lecture notes in computer science 539
Schlagworte:
Online Zugang:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Anmerkung: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Applied algebra, algebraic algorithms, and error-correcting codes, 9th International Symposium, AAECC-9, New Orleans, LA, USA, October 7-11, 1991, proceedings, H.F. Mattson, T. Mora, T.R.N. Rao, eds, Berlin, Springer-Verlag, 1991, 1 vol. (xi-488 p.), Lecture notes in computer science, 3-540-54522-0
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Texte imprimé, 9783662177549
Inhaltsangabe:
  • Algorithms for the shape of semialgebraic sets a new approach
  • On the parameters of algebraic geometric codes
  • On wiedemann's method of solving sparse linear systems
  • Fast algorithms for decoding orthogonal and related codes
  • Jacobian matrices and constructions in algebra
  • Homogenity, pseudo-homogenity, and Gröbner basis computations
  • Arithmetic on non supersingular elliptic curves
  • Implementing some algorithms of kantor
  • Computing roadmaps of general semi-algebraic sets
  • An improved sign determination algorithm
  • The 2-nd generalized Hamming weight of double-error correcting binary BCH codes and their dual codes
  • Buchberger algorithm and integer programming
  • New systolic architectures for cyclic code encoding
  • Algebraic constructions of efficient broadcast networks
  • Error-correction for WIMs and WUMs
  • Some constructions in rings of differential polynomials
  • Concurrent error detection in sequential circuits using convolutional codes
  • An algorithm for the computation of the radical of an ideal in the ring of polynomials
  • Integer multiplication in PARSAC-2 on stock microprocessors
  • Polynomial-time construction of spherical codes
  • Algorithms for a multiple algebraic extension II
  • On the orphans and covering radius of the reed-muller codes
  • A joint authentication and encryption scheme based on algebraic coding theory
  • Arithmetic codes - Survey, recent and new results
  • Some results on linear unequal-error-protection codes specified by their generator matrix
  • An ackermannian polynomial ideal
  • Complexity of the computation of the canonical Whitney stratification of an algebraic set in Cn
  • Some undecidability results for weakly confluent monadic string-rewriting systems
  • Calculating multidimensional symmetric functions using Jacobi's formula.-Multivariate Sturm theory
  • Binary spherical geometric codes
  • An algebraic construction of generalized Beenker's codes
  • Improving the time complexity of the computation of irreducible and primitive polynomials in finite fields
  • Completely transitive codes and distance transitive graphs
  • Placement of curved polygons
  • On the weights of the elements of the duals of binary BCH codes
  • Computation of the openness of some loci of modules
  • Random and byte error correcting codes for asymmetric or unidirectional error control
  • Finding a minimal polynomial vector set of a vector of nD arrays
  • Covering codes and combinatorial optimization
  • Decoding of quadrature partial response- trellis coded signals (QPR-TCM) in the presence of intersymbol interference and noise
  • On algebraic solutions of linear differential equations with primitive unimodular Galois group
  • Error detection and correction in numerical computations
  • d-Functions in V k (F 2) and self-decimation of m-sequences
  • Multilevel modulation codes for rayleigh fading channels.