Applied algebra, algebraic algorithms, and error-correcting codes : 11th international symposium, AAECC-11, Paris, France, July 1995 : proceedings / Gérard Cohen, Marc Giusti, Teo Mora (eds.).

By: AAECC-11 (1995 : Paris, France)
Contributor(s): Cohen, G. (Gérard), 1951- | Giusti, Marc | Mora, Teo
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 948.Publisher: Berlin ; New York : Springer-Verlag, 1995Description: 1 online resource (xi, 484 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540494409; 3540494405Subject(s): Error-correcting codes (Information theory) -- Congresses | Algebra -- Data processing -- Congresses | Algorithms -- Congresses | Algorithmes -- Congrès | Algèbre -- Informatique -- Congrès | Codes correcteurs d'erreurs (Théorie de l'information) -- Congrès | Algebra -- Data processing | Algorithms | Error-correcting codes (Information theory) | Fundamentele informatica | Geheimschrift | Algoritmen | Codes | Fouten | Codes correcteurs d'erreurs (théorie de l'information) -- Congrès | Algorithmes -- CongrèsGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Applied algebra, algebraic algorithms, and error-correcting codes.DDC classification: 005.7/2 LOC classification: QA268 | .A35 1995Online resources: Click here to access online
Contents:
Supports of a Code / L.A. Bassalygo -- Chemical Isomerism, a Challenge for Algebraic Combinatorics and for Computer Science / C. Benecke, R. Grund, R. Hohberger, A. Kerber, R. Laue and T. Wieland -- On Algebraic Methods in Covering Radius Problems / I. Honkala, S. Litsyn and A. Tietavainen -- How Lower and Upper Complexity Bounds Meet in Elimination Theory / L.M. Pardo -- Bivariate Polynomial Multiplication Patterns / A. Schonhage -- Division of Entire Functions by Polynomial Ideals / J. Apel -- Variations on Minimal Codewords in Linear Codes / A. Ashikhmin, A. Barg, G. Cohen and L. Huguet -- On the Computation of the Radical of Polynomial Complete Intersection Ideals / I. Armendariz and P. Solerno -- Which Families of Long Binary Linear Codes Have a Binomial Weight Distribution? / T. Beth, H. Kalouti and D.E. Lazic -- The Discovery of Simple 7-Designs with Automorphism Group P[gamma]L(2,32) / A. Betten, A. Kerber, A. Kohnert, R. Laue and A. Wassermann.
Summary: This book constitutes the proceedings of the 11th International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-11, held in Paris, France in July 1995. The volume presents five invited papers and 32 full revised research papers selected from a total of 68 submissions; it is focussed on research directed to the exploitation of algebraic techniques and methodologies for the application in coding and computer algebra. Among the topics covered are coding, cryptoloy, communication, factorization of polynomials, Grbner bases, computer algebra, algebraic algorithms, symbolic computation, algebraic manipulation.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

Supports of a Code / L.A. Bassalygo -- Chemical Isomerism, a Challenge for Algebraic Combinatorics and for Computer Science / C. Benecke, R. Grund, R. Hohberger, A. Kerber, R. Laue and T. Wieland -- On Algebraic Methods in Covering Radius Problems / I. Honkala, S. Litsyn and A. Tietavainen -- How Lower and Upper Complexity Bounds Meet in Elimination Theory / L.M. Pardo -- Bivariate Polynomial Multiplication Patterns / A. Schonhage -- Division of Entire Functions by Polynomial Ideals / J. Apel -- Variations on Minimal Codewords in Linear Codes / A. Ashikhmin, A. Barg, G. Cohen and L. Huguet -- On the Computation of the Radical of Polynomial Complete Intersection Ideals / I. Armendariz and P. Solerno -- Which Families of Long Binary Linear Codes Have a Binomial Weight Distribution? / T. Beth, H. Kalouti and D.E. Lazic -- The Discovery of Simple 7-Designs with Automorphism Group P[gamma]L(2,32) / A. Betten, A. Kerber, A. Kohnert, R. Laue and A. Wassermann.

Print version record.

This book constitutes the proceedings of the 11th International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-11, held in Paris, France in July 1995. The volume presents five invited papers and 32 full revised research papers selected from a total of 68 submissions; it is focussed on research directed to the exploitation of algebraic techniques and methodologies for the application in coding and computer algebra. Among the topics covered are coding, cryptoloy, communication, factorization of polynomials, Grbner bases, computer algebra, algebraic algorithms, symbolic computation, algebraic manipulation.

There are no comments for this item.

to post a comment.

Powered by Koha