Fundamentals of Error-Correcting Codes
Fundamentals of Error Correcting Codes is an in-depth introduction to coding theory from both an engineering and mathematical viewpoint. As well as covering classical topics, much coverage is included of recent techniques which until now could only be found in specialist journals and book publications. Numerous exercises and examples and an accessible writing style make this a lucid and effective introduction to coding theory for advanced undergraduate and graduate students, researchers and engineers, whether approaching the subject from a mathematical, engineering or computer science background.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Basic concepts of linear codes
Bounds On the Size of COdes
BCH and ReedSolomon COdes
Some favorite Selfdual COdes
Covering radius and cosets
Codes over Z4
Codes from algebraic geometry
Soft decision and iterative decoding
Other editions - View all
Ag(n assume Asymptotic BCH codes binary Golay code blocks C1 and C2 code of length code over F codewords codewords of weight columns compute construction contains convolutional code coordinates Corollary coset leader cosets modulo cosets of weight covering radius cyclic code defining set degree denoted dimension divisor doubly-even elements of F encoder entries equations equivalent errors even-like Example Exercise exist following hold formally self-dual given gives Hamming code hence Hermitian hexacode idempotent implying inner product integer irreducible polynomials lattice Lemma linear code matrix G minimum distance minimum weight multiple nonzero obtained orthogonal parity check matrix PAut(C permutation points primitive projective plane Proof punctured QR codes quadratic residue codes received vector Reed–Solomon codes Section self-dual binary codes self-dual codes self-orthogonal Show subcode Suppose syndrome Table ternary Golay code trellis Type II codes unique upper bound Verify weight codewords weight distribution weight enumerator wt(x zero