Applied Algebra, Algorithmics and Error-Correcting Codes (Record no. 33842)

000 -LEADER
fixed length control field 03233nam a22004695i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540388135
-- 978-3-540-38813-5
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
245 10 - TITLE STATEMENT
Title Applied Algebra, Algorithmics and Error-Correcting Codes
Sub Title 2nd International Conference, AAECC-2 Toulouse, France, October 1–5, 1984 Proceedings /
Statement of responsibility, etc edited by Alain Poli.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 1986.
300 ## - PHYSICAL DESCRIPTION
Number of Pages VIII, 268 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Coding theory.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer software.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Coding and Information Theory.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Poli, Alain.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/3-540-16767-6
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1986.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK4548 http://dx.doi.org/10.1007/3-540-16767-6 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha