Elements of Algebraic Coding Systems


Book Description

Elements of Algebraic Coding Systems is an introductory text to algebraic coding theory. In the first chapter, you’ll gain inside knowledge of coding fundamentals, which is essential for a deeper understanding of state-of-the-art coding systems. This book is a quick reference for those who are unfamiliar with this topic, as well as for use with specific applications such as cryptography and communication. Linear error-correcting block codes through elementary principles span eleven chapters of the text. Cyclic codes, some finite field algebra, Goppa codes, algebraic decoding algorithms, and applications in public-key cryptography and secret-key cryptography are discussed, including problems and solutions at the end of each chapter. Three appendices cover the Gilbert bound and some related derivations, a derivation of the Mac- Williams’ identities based on the probability of undetected error, and two important tools for algebraic decoding—namely, the finite field Fourier transform and the Euclidean algorithm for polynomials.




Elements of Algebraic Coding Theory


Book Description

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.




Algebraic Codes on Lines, Planes, and Curves


Book Description

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.




Elements of Algebraic Coding Theory


Book Description

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.




Algebraic Geometry in Coding Theory and Cryptography


Book Description

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




Elements of Programming


Book Description

Elements of Programming provides a different understanding of programming than is presented elsewhere. Its major premise is that practical programming, like other areas of science and engineering, must be based on a solid mathematical foundation. This book shows that algorithms implemented in a real programming language, such as C++, can operate in the most general mathematical setting. For example, the fast exponentiation algorithm is defined to work with any associative operation. Using abstract algorithms leads to efficient, reliable, secure, and economical software.




Codes and Curves


Book Description

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.




Algebraic Coding Theory (Revised Edition)


Book Description

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.




Algebraic and Stochastic Coding Theory


Book Description

Using a simple yet rigorous approach, Algebraic and Stochastic Coding Theory makes the subject of coding theory easy to understand for readers with a thorough knowledge of digital arithmetic, Boolean and modern algebra, and probability theory. It explains the underlying principles of coding theory and offers a clear, detailed description of each code. More advanced readers will appreciate its coverage of recent developments in coding theory and stochastic processes. After a brief review of coding history and Boolean algebra, the book introduces linear codes, including Hamming and Golay codes. It then examines codes based on the Galois field theory as well as their application in BCH and especially the Reed–Solomon codes that have been used for error correction of data transmissions in space missions. The major outlook in coding theory seems to be geared toward stochastic processes, and this book takes a bold step in this direction. As research focuses on error correction and recovery of erasures, the book discusses belief propagation and distributions. It examines the low-density parity-check and erasure codes that have opened up new approaches to improve wide-area network data transmission. It also describes modern codes, such as the Luby transform and Raptor codes, that are enabling new directions in high-speed transmission of very large data to multiple users. This robust, self-contained text fully explains coding problems, illustrating them with more than 200 examples. Combining theory and computational techniques, it will appeal not only to students but also to industry professionals, researchers, and academics in areas such as coding theory and signal and image processing.




Elements of Computer Algebra With Applications


Book Description

Numerical Modeling in Science and Engineering Myron B. Allen, George F. Pinder, and Ismael Herrera Emphasizing applications, this treatment combines three traditionally distinct disciplines—continuum mechanics, differential equations, and numerical analysis—to provide a unified treatment of numerical modeling of physical systems. Covers basic equations of macroscopic systems, numerical methods, steady state systems, dissipative systems, nondissipative systems, and high order, nonlinear, and coupled systems. 1988 (0 471-80635-8) 418 pp. Mathematical Modeling and Digital Simulation for Engineers and Scientists Second Edition Jon M. Smith Totally updated, this Second Edition reflects the many developments in simulation and computer modeling theory and practice that have occurred over the past decade. It includes a new section on the use of modern numerical methods for generating chaos and simulating random processes, a section on simulator verification, and provides applications of these methods for personal computers. Readers will find a wealth of practical fault detection and isolation techniques for simulator verification, fast functions evaluation techniques, and nested parenthetical forms and Chebyshev economization techniques. 1987 (0 471-08599-5) 430 pp. Numerical Analysis 1987 David F. Griffiths and George Alistair Watson An invaluable guide to the direction of current research in many areas of numerical analysis, this volume will be of great interest to anyone involved in software design, curve and surface fitting, the numerical solution of ordinary, partial, and integro-differential equations, and the real-world application of numerical techniques. 1988 (0 470-21012-5) 300 pp.