Applied algebra, algorithmics and error-correcting codes : 2nd international conference, AAECC-2, Toulouse, France, October 1-5, 1984 : proceedings
Zapisane w:
| Korporacja: | |
|---|---|
| Kolejni autorzy: | |
| Format: | Livre numérique |
| Język: | Anglais Français |
| Wydane: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seria: | Lecture notes in computer science
228 |
| Hasła przedmiotowe: | |
| Dostęp online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Komentarz: |
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, algorithmics and error-correcting codes, proceedings, 2nd international conference, AAECC-2, Toulouse, France, October 1-5, 1984 ; ed, by Alain Poli, Berlin, Springer, 1986, 1 Vol. (VI-265 p.), Lecture notes in computer science, 3-540-16767-6 • Applied Algebra, Algorithmics and Error-Correcting Codes, Texte imprimé, 9783662178782 |
Spis treści:
- On associative algebras of minimal rank
- Construction of primitive idempotents for a variable codes
- Multivariate polynomials in coding theory
- Enumeration of self dual 2k circulant codes
- Codes, groups and invariants
- On a conjecture concerning coverings of Hamming space
- An improved upper bound on covering radius
- Association schemes and difference sets defined on two weight codes
- Automorphisms of two families of extended non binary cyclic Goppa Codes
- Some quasi-perfect cyclic codes
- Explicit Kerdock codes over GF(2)
- Une classe de codes 2-correcteurs adaptes aux systems d'information formates
- LOUSTICC simulation software : Experimental results of coding systems
- An algorithm of complete decoding of double-error-correcting goppa codes
- On the number of divisors of a polynomial over GF(2)
- Multivariate polynomial factoring and detection of true factors
- Discriminants and the irreducibility of a class of polynomials
- Computational aspects of reduction strategies to construct resolutions of monomial ideals
- Designs arising from symplectic geometry
- Distance transitive graphs and the problem of maximal subgroups of symmetric groups
- Can a fast signature scheme without secret key be secure / Un Schema de Signature Courte et Rapide N'Utilisant pas de CLE Secrete Peut-IL Etre Fiable?
- Manipulation of recurrence relations in computer algebra
- Some design principles for a mathematical knowledge representation system: A new approach to scientific calculation.