UID:
edoccha_9959186094902883
Format:
1 online resource (VIII, 268 p.)
Edition:
1st ed. 1986.
Edition:
Online edition Springer Lecture Notes Archive ; 041142-5
ISBN:
3-540-38813-3
Series Statement:
Lecture Notes in Computer Science, 228
Note:
Bibliographic Level Mode of Issuance: Monograph
,
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.
,
English
In:
Springer eBooks
Additional Edition:
ISBN 3-540-16767-6
Language:
English
DOI:
10.1007/3-540-16767-6
URL:
http://dx.doi.org/10.1007/3-540-16767-6
