Détail de l'auteur
Auteur teo mora |
Documents disponibles écrits par cet auteur (1)
Affiner la recherche Interroger des sources externes
Titre : APPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERROR- CORRECTING CODES Type de document : texte imprimé Auteurs : teo mora ; harold mattson Editeur : Allemagne : Springer Année de publication : 1997 Collection : Lecture Notes in Computer Science num. 1255 Importance : 352 p. Format : 23.5 cm. ISBN/ISSN/EAN : 978-3-540-63163-7 Note générale : index: Minimun distance decoding algorithms for linear codes.- Efficient multivariate factorization over finite fields.- On maximal codes in polynomial metric spaces.- Yet another ideal decomposition algorithm.- A resultant theory for ordinary algebraic differential equations.- The symmetry group of ? q n in the Lee space and the ? q n-linear codes.- On repeated-root cyclic codes and the two-way chain condition.- Exponentiation in finite fields: Theory and practice.- Computing minimum-link path in a homotopy class amidst semi-algebraic obstacles in the plane.- Certain self-dual codes over ?4 and the odd Leech lattice.- Order functions and evaluation codes.- Codes from cocycles.- A brief tour of split linear programming.- Elementary approximation of exponentials of Lie polynomials.- On the q-ary image of cyclic codes.- The split weight (w L , w R ) enumeration of Reed-Muller codes for w L +w R d min.- Optimal linear codes of dimension 4 over GF(5).- Characterisations of lexicographic sets and simply-connected Hilbert schemes.- An iterative probabilistic decoding algorithm for binary linear block codes beyond the half minimum distance.- Security examination of a cellular automata based pseudorandom bit generator using an algebraic replica approach.- Formal duality of linearly presentable codes over a Galois field.- Trace-function on a Galois ring in coding theory.- A vector version of the BMS algorithm for implementing fast erasure-and-error decoding of one-point AG codes.- On generalized Hamming weights of codes constructed on affine algebraic sets.- Some results on regular mappings.- Extension theorems for linear codes over finite rings.- Nonperiodic cyclic equivalence classes of cyclic codes and algebraic constructions of cyclically permutable codes. Langues : Anglais (eng) Langues originales : Allemand (ger) Résumé : This volume features 27 revised full papers from the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes held in 1997. The papers address a broad range of issues in coding theory and computer algebra spanning polynomials. APPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERROR- CORRECTING CODES [texte imprimé] / teo mora ; harold mattson . - Allemagne : Springer, 1997 . - 352 p. ; 23.5 cm.. - (Lecture Notes in Computer Science; 1255) .
ISBN : 978-3-540-63163-7
index: Minimun distance decoding algorithms for linear codes.- Efficient multivariate factorization over finite fields.- On maximal codes in polynomial metric spaces.- Yet another ideal decomposition algorithm.- A resultant theory for ordinary algebraic differential equations.- The symmetry group of ? q n in the Lee space and the ? q n-linear codes.- On repeated-root cyclic codes and the two-way chain condition.- Exponentiation in finite fields: Theory and practice.- Computing minimum-link path in a homotopy class amidst semi-algebraic obstacles in the plane.- Certain self-dual codes over ?4 and the odd Leech lattice.- Order functions and evaluation codes.- Codes from cocycles.- A brief tour of split linear programming.- Elementary approximation of exponentials of Lie polynomials.- On the q-ary image of cyclic codes.- The split weight (w L , w R ) enumeration of Reed-Muller codes for w L +w R d min.- Optimal linear codes of dimension 4 over GF(5).- Characterisations of lexicographic sets and simply-connected Hilbert schemes.- An iterative probabilistic decoding algorithm for binary linear block codes beyond the half minimum distance.- Security examination of a cellular automata based pseudorandom bit generator using an algebraic replica approach.- Formal duality of linearly presentable codes over a Galois field.- Trace-function on a Galois ring in coding theory.- A vector version of the BMS algorithm for implementing fast erasure-and-error decoding of one-point AG codes.- On generalized Hamming weights of codes constructed on affine algebraic sets.- Some results on regular mappings.- Extension theorems for linear codes over finite rings.- Nonperiodic cyclic equivalence classes of cyclic codes and algebraic constructions of cyclically permutable codes.
Langues : Anglais (eng) Langues originales : Allemand (ger)
Résumé : This volume features 27 revised full papers from the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes held in 1997. The papers address a broad range of issues in coding theory and computer algebra spanning polynomials. Réservation
Réserver ce document
Exemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité M8/614--1 M8/614 Périodique Mathématiques et 'informatique indéterminé Disponible M8/614--2 M8/614 Périodique Mathématiques et 'informatique indéterminé Disponible
