Algebraic algorithms and error-correcting codes : 3rd International conference, AAECC-3, Grenoble, France, July 15-19, 1985 : proceedings
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
229 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algebraic algorithms and error-correcting codes, proceedings, 3rd International conference, AAECC-3, Grenoble, France, July 15-19, 1985, edited by Jacques Calmet, Berlin, Springer-Verlag, 1986, 1 vol. (VII-415 p.), Lecture notes in computer science, 3-540-16776-5 • Algebraic Algorithms and Error-Correcting Codes, Texte imprimé, 9783662214534 |
Indholdsfortegnelse:
- 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