Coding Technology - fall 2025

Lecture slides:
  • Lecture 1 (Introduction)
  • Lecture 2 (Binary block coding scheme)
  • Lecture 3 (Binary linear codes)
  • Lecture 4 (Hamming codes, Hadamard codes, Basic code operations)
  • Lecture 5 (Binary Golay codes, CRC codes, LDPC codes)
  • Lecture 6 (Nonbinary block coding, Galois fields)
  • Lecture 7 (Reed-Solomon codes)
  • Lecture 8 (Reed-Solomon codes II, GF(2^m))
  • Lecture 9 (GF(2^m) architectures, BCH codes)
  • Lecture 10 (Data compression, character encoding)
  • Lecture 11 (Adaptive Huffman code, Dictionary coders)
  • Lecture 12 (Text transforms, Quantization)
  • Lecture 13 (Vector Quantization)
  • Lecture 14 (Cryptography, RSA algorithm)
    • Practice slides:
  • Practice 1 (BSC, block coding scheme, linear codes)
  • Practice 2 (Hamming codes, CRC codes, QoS)
  • Practice 3 (Reed-Solomon codes, BCH codes)
  • Practice 4 (Character encoding)
  • Practice 5 (Dictionary coders, Text transforms, Quantization)
  • Sample midterm tests
  • Sample midterm test solutions