Applied algebra, algebraic algorithms, and error-correcting codes : 12th international symposium, AAECC-12, Toulouse, France, June 23-27, 1997 : proceedings
This book constitutes the strictly refereed proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-12, held in Toulouse, France, June 1997. The 27 revised full papers presented were carefully selected by the program committee for in...
Shranjeno v:
| Korporativna značnica: | |
|---|---|
| Drugi avtorji: | , |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
1255 |
| Teme: | |
| Online dostop: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Sporočilo: |
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, 12th international symposium, AAECC-12, Toulouse, France, June 23-27, 1997, proceedings, Teo Mora, Harold Mattson (eds.), 1997, New York, Springer, 1 vol. (X-352 p.), Lecture notes in computer science, 3-540-63163-1 • Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Texte imprimé, 9783662163337 |
Kazalo:
- 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.