Applied Algebra, Algorithmics and Error-Correcting Codes [[electronic resource] ] : 2nd International Conference, AAECC-2, Toulouse, France, October 1-5, 1984. Proceedings / / edited by Alain Poli
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
Applied Algebra, Algorithmics and Error-Correcting Codes [[electronic resource] ] : 2nd International Conference, AAECC-2, Toulouse, France, October 1-5, 1984. Proceedings / / edited by Alain Poli
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 |
| Edizione: | 1st ed. 1986. |
| Descrizione fisica: | 1 online resource (VIII, 268 p.) |
| Disciplina: | 004.0151 |
| Soggetto topico: | Computers |
| Algorithms | |
| Coding theory | |
| Information theory | |
| Theory of Computation | |
| Algorithm Analysis and Problem Complexity | |
| Coding and Information Theory | |
| Persona (resp. second.): | PoliAlain |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di contenuto: | 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. |
| Titolo autorizzato: | Applied Algebra, Algorithmics and Error-Correcting Codes |
| ISBN: | 3-540-38813-3 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996465709303316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |
Serie:
Lecture Notes in Computer Science, . 0302-9743 ; ; 228