Amazon cover image
Image from Amazon.com
Image from Google Jackets

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.

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 228Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1986Description: VIII, 268 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540388135
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 005.1 23
LOC classification:
  • QA76.9.A43
Online resources:
Contents:
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.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified URL Status Date due Barcode
IMSc Library Link to resource Available EBK4548

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India