Tentative Outline of Course ELE 539, Princeton, Spring `98

1. Motivation and introduction
   repetition code, single parity check code,
   Hamming code, maximum likelihood decoding,
   minimum distance, syndrome decoding,
2. Finite Fields
3. Block Codes
   3.1 Basic definitions and properties
       nonlinear, linear, generator matrix
       parity check matrix, dual code, 
       obtaining new codes from old ones
   3.2 The spectral view of codes
       3.2.1 The FT over finite fields
       3.2.2 RS and BCH codes
   3.3 Decoding of RS and BCH codes
       (Peterson-Gorenstein, Berlekamp-Massey,
        Forney algorithm, Chien search)
   3.4 Cyclic Codes
       3.3.1  Basic Definitions and Properties
       3.3.2 RS and BCH codes as cyclic codes
       3.3.3 Golay code: existence and uniqueness
   3.5 Bounds on codes
       Singleton, Hamming, Gilbert, Elias, Plotkin
   3.6 The MacWilliams Identitity
4. Convolutional Codes
   4.1 Basic definitions and simple examples 
       linear shift registers, systematic, 
       feedforward, recursive,
       state diagram, trellis, catastrophic,
       minimal, free distance
   4.2 Viterbi algorithm, Bahl algorithm
5. Turbo Codes
   5.1 Parallel, serial
   5.2 The iterative decoding procedure
   5.3 Codes on graphs
   5.4 Code ensemble performance bounds      
   5.5 Extensions of the turbo-coding principle
   5.6 Open problems     
6. Codes for higher spectral efficiency 
   6.1 Imai's multilevel codes
   6.2 Ungerboeck's trellis coded modulation
   6.3 Codes derived from turbo codes


Last modified: 30 Jan 1998