Linear block codes

  1. Computing the weight distribution
  2. Bounds on error performance over AWGN, flat Rayleigh fading and BSC channels
Hamming, Golay and Reed-Muller codes
  1. Hamming codes
  2. Binary Golay (23,12,7) code and extended Golay (24,12,8) code
  3. First order RM codes
Binary cyclic codes and BCH codes
  1. Error-trapping decoding of cyclic codes
  2. Berlekamp-Massey, Euclidean and PGZ algorithms
  3. Chien search and error correction
  4. Errors-and-erasures decoding
  5. Error performance evaluation
Reed-Solomon codes
  1. Berlekamp-Massey, Euclidean and PGZ algorithms
  2. Errors-and-erasures decoding
  3. Error performance evaluation
Binary convolutional codes
  1. Weight enumeration sequences and error performance evaluation
  2. Viterbi algorithm with Hamming metrics
  3. Viterbi algorithm with Euclidean metrics
  4. Punctured convolutional codes
Soft-decision decoding
  1. Decoding binary linear block codes with a trellis
  2. Chase type-II algorithm
  3. Ordered statistics decoding (OSD)
  4. GMD decoding
Soft-input soft-output (SISO) algorithms
  1. MAP and log-MAP
  2. Max-log-MAP
  3. SOVA
  4. SO-OSD and SO-Chase
Iteratively decodable codes
  1. Parallel concatenation (turbo codes)
  2. Serial concatenation (product codes)
  3. Block product codes
  4. Low-density parity-check (LDPC) codes
Coded modulation
  1. Trellis coded modulation (TCM)
  2. Pragmatic TCM
  3. Multilevel coded modulation (MCM)
  4. Bit-interleaved coded modulation (BICM)
  5. Turbo TCM

This page was last updated on August 6, 2008, by Robert H. Morelos-Zaragoza.