000 03233nam a22004695i 4500
001 978-3-540-38813-5
003 DE-He213
005 20160624101941.0
007 cr nn 008mamaa
008 121227s1986 gw | s |||| 0|eng d
020 _a9783540388135
_9978-3-540-38813-5
024 7 _a10.1007/3-540-16767-6
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aApplied Algebra, Algorithmics and Error-Correcting Codes
_h[electronic resource] :
_b2nd International Conference, AAECC-2 Toulouse, France, October 1–5, 1984 Proceedings /
_cedited by Alain Poli.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1986.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1986.
300 _aVIII, 268 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v228
505 0 _aOn 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.
650 0 _aComputer science.
650 0 _aCoding theory.
650 0 _aComputer software.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aCoding and Information Theory.
700 1 _aPoli, Alain.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540167679
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v228
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-16767-6
942 _2EBK4548
_cEBK
999 _c33842
_d33842