You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book constitutes the refereed proceedings of the 16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-16, held in Las Vegas, NV, USA in February 2006. The 25 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 32 submissions. Among the subjects addressed are block codes; algebra and codes: rings, fields, and AG codes; cryptography; sequences; decoding algorithms; and algebra: constructions in algebra, Galois groups, differential algebra, and polynomials.
Algebraic & geometry methods have constituted a basic background and tool for people working on classic block coding theory and cryptography. Nowadays, new paradigms on coding theory and cryptography have arisen such as: Network coding, S-Boxes, APN Functions, Steganography and decoding by linear programming. Again understanding the underlying procedure and symmetry of these topics needs a whole bunch of non trivial knowledge of algebra and geometry that will be used to both, evaluate those methods and search for new codes and cryptographic applications. This book shows those methods in a self-contained form.
The discovery of new algorithms for dealing with polynomial equations, and their implementation on fast, inexpensive computers, has revolutionized algebraic geometry and led to exciting new applications in the field. This book details many uses of algebraic geometry and highlights recent applications of Grobner bases and resultants. This edition contains two new sections, a new chapter, updated references and many minor improvements throughout.
Advances in Algebraic Geometry Codes presents the most successful applications of algebraic geometry to the field of error-correcting codes, which are used in the industry when one sends information through a noisy channel. The noise in a channel is the corruption of a part of the information due to either interferences in the telecommunications or degradation of the information-storing support (for instance, compact disc). An error-correcting code thus adds extra information to the message to be transmitted with the aim of recovering the sent information. With contributions from renowned researchers, this pioneering book will be of value to mathematicians, computer scientists, and engineers in information theory.
This volume collects papers presented at the eighth São Carlos Workshop on Real and Complex Singularities, held at the IML, Marseille, July 2004. Like the workshop, this collection establishes the state of the art and presents new trends, new ideas and new results in all of the branches of singularities. Real and Complex Singularities offers a useful summary of leading ideas in singularity theory, and inspiration for future research.
This book offers a selection of papers based on talks at the Ninth International Workshop on Real and Complex Singularities, a series of biennial workshops organized by the Singularity Theory group at Sao Carlos, S.P., Brazil. The papers deal with all the different topics in singularity theory and its applications, from pure singularity theory related to commutative algebra and algebraic geometry to those topics associated with various aspects of geometry to homotopytheory.
Ever since the seminal work of Goppa on algebraic-geometry codes, rational points on algebraic curves over finite fields have been an important research topic for algebraic geometers and coding theorists. The focus in this application of algebraic geometry to coding theory is on algebraic curves over finite fields with many rational points (relative to the genus). Recently, the authors discovered another important application of such curves, namely to the construction of low-discrepancy sequences. These sequences are needed for numerical methods in areas as diverse as computational physics and mathematical finance. This has given additional impetus to the theory of, and the search for, algebraic curves over finite fields with many rational points. This book aims to sum up the theoretical work on algebraic curves over finite fields with many rational points and to discuss the applications of such curves to algebraic coding theory and the construction of low-discrepancy sequences.
Coding theory and cryptography allow secure and reliable data transmission, which is at the heart of modern communication. Nowadays, it is hard to find an electronic device without some code inside. Gröbner bases have emerged as the main tool in computational algebra, permitting numerous applications, both in theoretical contexts and in practical situations. This book is the first book ever giving a comprehensive overview on the application of commutative algebra to coding theory and cryptography. For example, all important properties of algebraic/geometric coding systems (including encoding, construction, decoding, list decoding) are individually analysed, reporting all significant approaches appeared in the literature. Also, stream ciphers, PK cryptography, symmetric cryptography and Polly Cracker systems deserve each a separate chapter, where all the relevant literature is reported and compared. While many short notes hint at new exciting directions, the reader will find that all chapters fit nicely within a unified notation.
Singularities arise naturally in a huge number of different areas of mathematics and science. As a consequence, singularity theory lies at the crossroads of paths that connect many of the most important areas of applications of mathematics with some of its most abstract regions. The main goal in most problems of singularity theory is to understand the dependence of some objects of analysis, geometry, physics, or other science (functions, varieties, mappings, vector or tensor fields, differential equations, models, etc.) on parameters. The articles collected here can be grouped under three headings. (A) Singularities of real maps; (B) Singular complex variables; and (C) Singularities of homomorphic maps.
This book is made of the proceedings of EUROCODE 1992 which was held in Udine (Italy) at the CISM, October 27 - 30, 1992. EUROCODE ’92 is a continuation as well as an extension of the previous colloquia Trois Journèes sur le codage and EUROCODE ’90, whose proceedings appeared as Lecture Notes in Computer Science (Volumes 388 and 514). The aim of EUROCODE ’92 was to attract high level research papers and to encourage interchange of ideas among the areas of coding theory and related fields which share the same tools for applications in the science of communications, theoretical computer science, software engineering and mathematics. Then the book is characterized by a very broad spectrum, ranging from combinatories or algebraic geometry to implementation of coding algorithms. There were about 90 participants to the conference, from the academic and industrial worlds; 53 conferences were selected. The submitted full-papers were separately refereed for publication by at least two international referees.