Coding theory came into existence in the late 1940's and is concerned with devising efficient encoding and decoding procedures. The book is intended as a principal text for first courses in coding and algebraic coding theory, and is aimed at advanced undergraduates and recent graduates as both a course and self-study text. BCH and cyclic, Group codes, Hamming codes, polynomial as well as many other codes are introduced in this textbook. Incorporating numerous worked examples and complete logical proofs, it is an ideal introduction to the fundamental of algebraic coding.

Coding theory came into existence in the late 1940s and is concerned with devising efficient encoding and decoding procedures. The book is intended as a principal text for first courses in coding and algebraic coding theory, and is aimed at advanced undergraduates and recent graduates as both a course and self-study text. BCH and cyclic, Group codes, Hamming codes, polynomial as well as many other codes are introduced in this textbook. Incorporating numerous worked examples and complete logical proofs, it is an ideal introduction to the fundamental of algebraic coding.

This textbook equips graduate students and advanced undergraduates with the necessary theoretical tools for applying algebraic geometry to information theory, and it covers primary applications in coding theory and cryptography. Harald Niederreiter and Chaoping Xing provide the first detailed discussion of the interplay between nonsingular projective curves and algebraic function fields over finite fields. This interplay is fundamental to research in the field today, yet until now no other textbook has featured complete proofs of it. Niederreiter and Xing cover classical applications like algebraic-geometry codes and elliptic-curve cryptosystems as well as material not treated by other books, including function-field codes, digital nets, code-based public-key cryptosystems, and frameproof codes. Combining a systematic development of theory with a broad selection of real-world applications, this is the most comprehensive yet accessible introduction to the field available. Introduces graduate students and advanced undergraduates to the foundations of algebraic geometry for applications to information theory Provides the first detailed discussion of the interplay between projective curves and algebraic function fields over finite fields Includes applications to coding theory and cryptography Covers the latest advances in algebraic-geometry codes Features applications to cryptography not treated in other books

The past few years have witnessed significant developments in algebraic coding theory. This book provides an advanced treatment of the subject from an engineering perspective, covering the basic principles and their application in communications and signal processing. Emphasis is on codes defined on the line, on the plane, and on curves, with the core ideas presented using commutative algebra and computational algebraic geometry made accessible using the Fourier transform. Starting with codes defined on a line, a background framework is established upon which the later chapters concerning codes on planes, and on curves, are developed. The decoding algorithms are developed using the standard engineering approach applied to those of Reed-Solomon codes, enabling them to be evaluated against practical applications. Integrating recent developments in the field into the classical treatment of algebraic coding, this is an invaluable resource for graduate students and researchers in telecommunications and applied mathematics.

Algebraic coding theory is a new and rapidly developing subject, popular for its many practical applications and for its fascinatingly rich mathematical structure. This book provides an elementary yet rigorous introduction to the theory of error-correcting codes. Based on courses given by the author over several years to advanced undergraduates and first-year graduated students, this guide includes a large number of exercises, all with solutions, making the book highly suitable for individual study.

Algebraic geometry is introduced, with particular attention given to projective curves, rational functions and divisors. The construction of algebraic geometric codes is given, and the Tsfasman-Vladut-Zink result mentioned above it discussed."--BOOK JACKET.

This is the revised edition of Berlekamp's famous book, 'Algebraic Coding Theory', originally published in 1968, wherein he introduced several algorithms which have subsequently dominated engineering practice in this field. One of these is an algorithm for decoding Reed-Solomon and Bose-Chaudhuri-Hocquenghem codes that subsequently became known as the Berlekamp-Massey Algorithm. Another is the Berlekamp algorithm for factoring polynomials over finite fields, whose later extensions and embellishments became widely used in symbolic manipulation systems. Other novel algorithms improved the basic methods for doing various arithmetic operations in finite fields of characteristic two. Other major research contributions in this book included a new class of Lee metric codes, and precise asymptotic results on the number of information symbols in long binary BCH codes.Selected chapters of the book became a standard graduate textbook.Both practicing engineers and scholars will find this book to be of great value.

In these papers associated with the workshop of December 2003, contributors describe their work in fountain codes for lossless data compression, an application of coding theory to universal lossless source coding performance bounds, expander graphs and codes, multilevel expander codes, low parity check lattices, sparse factor graph representations of Reed-Solomon and related codes. Interpolation multiplicity assignment algorithms for algebraic soft- decision decoding of Reed-Solomon codes, the capacity of two- dimensional weight-constrained memories, networks of two-way channels, and a new approach to the design of digital communication systems. Annotation :2005 Book News, Inc., Portland, OR (booknews.com).

The Mathematical Theory of Coding focuses on the application of algebraic and combinatoric methods to the coding theory, including linear transformations, vector spaces, and combinatorics. The publication first offers information on finite fields and coding theory and combinatorial constructions and coding. Discussions focus on self-dual and quasicyclic codes, quadratic residues and codes, balanced incomplete block designs and codes, bounds on code dictionaries, code invariance under permutation groups, and linear transformations of vector spaces over finite fields. The text then takes a look at coding and combinatorics and the structure of semisimple rings. Topics include structure of cyclic codes and semisimple rings, group algebra and group characters, rings, ideals, and the minimum condition, chains and chain groups, dual chain groups, and matroids, graphs, and coding. The book ponders on group representations and group codes for the Gaussian channel, including distance properties of group codes, initial vector problem, modules, group algebras, andrepresentations, orthogonality relationships and properties of group characters, and representation of groups. The manuscript is a valuable source of data for mathematicians and researchers interested in the mathematical theory of coding.

Coding theory is concerned with successfully transmitting data through a noisy channel and correcting errors in corrupted messages. It is of central importance for many applications in computer science or engineering. This book gives a comprehensive introduction to coding theory whilst only assuming basic linear algebra. It contains a detailed and rigorous introduction to the theory of block codes and moves on to more advanced topics like BCH codes, Goppa codes and Sudan's algorithm for list decoding. The issues of bounds and decoding, essential to the design of good codes, features prominently. The authors of this book have, for several years, successfully taught a course on coding theory to students at the National University of Singapore. This book is based on their experiences and provides a thoroughly modern introduction to the subject. There are numerous examples and exercises, some of which introduce students to novel or more advanced material.