Skip to content

Error Correcting Codes: Theory and Applications

Best in textbook rentals since 2012!

ISBN-10: 0132848945

ISBN-13: 9780132848947

Edition: 1992

Authors: Alian Poli, Llorenc Huguet, Iain Craig

List price: $48.00
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

This advanced text covers both the theory and applications of coding theory. Drawing on recent research, the book explains new developments in the field of information coding. Included are worked examples and exercises.
Customers also bought

Book details

List price: $48.00
Copyright year: 1992
Publisher: Prentice Hall
Binding: Cloth Text 
Language: English

Preface
Introduction
Information Theory
Concepts of Uncertainty and Information
Concept of uncertainty
Concept of information
Formalization of the Concept of Entropy
Entropy and Information
Definitions
Properties of entropy
Transmission Channels
Definitions
Mutual information
Capacity of a channel
Transmission over a Noiseless Channel
Definitions
Source coding
Huffman's algorithm
Transmission over Noisy Channels
Some definitions and results
Shannon's Second Theorem
Application to error correcting codes
Continuous Channels
Properties of the entropy function
Definition of a TDCA channel
Noise in continuous channels
Elements of Algebra
Basic Structures
Structures, substructures, morphisms
Cosets, quotient structures and morphism factorization
Useful Properties for Studying Error Correcting Codes
The ring Z
Vector space
The ring K[X]
The ring K[h]
The algebra K[X,Y]
Group Characters
Hadamard Matrices
Krawtchouk Polynomials
Finite Fields
Every Finite Field is Commutative
Prime Field
Existence of a Finite Field of Cardinal p[superscript n] (p prime, n [actual symbol not reproducible] N)
Uniqueness of the Finite Field of Cardinality p[superscript n]
Automorphisms of GF(p[superscript n])
Subgroups of GF(p[superscript n])
Trace and Norm
Bases of GF(p[superscript n]) Considered as a Vector Space over GF(p)
Squares and Non-Squares in GF(p[superscript n])
Factorization of Polynomials
Construction of a non-invertible element of algebra [GF(q)][superscript t]
Application to polynomial factorization
Solution of X[superscript 2] + Y[superscript 2] = [negative]k in GF(q)
Electronics and Computation in GF(q)
Finite fields and error correcting codes
Electronics and error correcting codes
Integration and VLSI: ASICs
Encoding algorithms and logic schemes
Encoding
Classical Error Correcting Codes
Introduction
Linear Codes
Definition and basic properties
Generator matrix, control matrix
Projective linear codes
Extended codes, truncated codes
Linear codes in systematic form
Decoding linear codes
Weight enumerator polynomials and MacWilliams identities
Regular codes
Hamming codes
The binary Golay code
Reed-Muller codes
Cyclic Codes
Polynomial representation of cyclic codes
Parity-check matrix of a cyclic code
Encoding using shift registers
BCH Codes
Decoding algorithm for BCH codes
2-correcting BCH codes
Reed-Solomon Codes
Encoding RS codes
Parity-deck matrix
Expression of RS codes over GF(p[superscript m]) in GF(p)
Other Codes
Fire codes
Quadratic residue codes
Shortened RM codes
Generalized Reed-Solomon codes
Goppa codes
Further Algebra
Multivariable Codes
Elementary properties
Semi-simple codes
Abelian semi-simple codes
Modular codes
Modular abelian codes
Semi-simple codes and Kasami's construction
Codes in one or more variables
Grobner Bases
Definitions and properties
A characteristic property of Grobner bases
Reduced Grobner bases
Existence and uniqueness of the RGB of an ideal
Application to codes
Other Error Correcting Codes
General Results for Multivariable Codes
Systems of generators: semi-simple codes
Systems of generators: modular codes
Generator and parity-check matrices
Calculation of the dimension of a code
Minimum distance
Encoding and coder
Decoding
Some Codes
Product codes
Fire codes
The codes of Blaum, Farrell et al.
Generalization of Kasami's construction
Concatenated codes
SDMC codes
Generalized Beenker codes
Principal self dual nilpotent codes
Extended cyclic codes: BCH, RS, GRM
Sakata primary codes
Codes over Rings
Algebraic Geometry and Codes
Introduction
Work on the Weil limit
Construction of new efficient codes
Projective curves and geometric codes
BCH codes as geometric codes
Codes and Combinatorics
Bounds on the Information Rate of a Code
Motivation and general issues
Bounds on the minimum distance
Combinatorically Regular Structures
General issues
t-designs and codes
Projective planes and codes
Association schemes
Distance-regular graphs
s-Sum sets
Relations between Combinatorial Structures
Basic relations
Generalizations of relations
Application of Codes
Coding Systems
Channels and noise
Transmitted and received signals
Protection algorithm
Error correcting codes
Maximum likelihood decoding
Soft decoding: Chasing
Checklist
Evaluation Criteria for the Proposed System
Theoretical curves
Experimental curves
Logical diagrams for coder and decoder
Some Implementations
The SPOT4 Satellite
Introduction
Reasons for using a corrective code
Coding specification
Codes selected
Implementation of the Hamming code
Optical Communications
Introduction
Presentation of modulation
Application of error correcting codes
Tables and Curves
Tables for Finite Fields
Tables for the fields (GF(2[superscript m]), m = 1 to 12)
Zech logarithmic tables
Traces of elements
Table of Irreducible Polynomials
Classification by exponent
Classification by degree
Error Probability (Gaussian White Noise)
Performance over a Gaussian Channel
Performance curves: BCH and RS codes
Discretization of curves
Bibliography
Index