Modern Error Correction

Modern Error Correction Coding for Telecommunications, Data Storage and Networking

  Lecture Exercises
Lecturer Dr. Laurent Schmalen Sebastian CammererAhmed Elkelesh
Date Wed 2:00 - 3:30 pm will be decided in first lecture
Lecture hall Pfaff. 47, room 2.348 Pfaff. 47, room 2.348
Extent 4 credit hours, 6 credit points
Language English
Learning outcome Basic knowledge about methods of classical coding theory, encoding and decoding methods and widespread classical coding schemes. Knowledge about modern coding theory and the implementation of modern coding schemes. Knowledge about conceptual design approaches of the error correction building blocks. Knowledge about the ubiquitous application of error correcting coding in digital communications and beyond and knowledge about current research results.

Detailed description of the content of this lecture.

  • Basic concepts and information theory and capacities of simple channel models
  • General concepts of error control coding in communications
  • Classical coding theory, review of the widespread BCH and Reed-Solomon coding schemes (e.g., DVD/BluRay)
  • Basics of state-of-the-art modern coding theory and iterative error correction schemes
  • Low-Density Parity-Check (LDPC) Codes, Turbo Codes, and Fountain codes
  • Design approaches and implementation of error correction schemes
  • Discussion of the application of error correction coding in digital wireless and wireline communication systems, for data storage and dissemination applications (e.g., hard drives), in computer networks, for content delivery, and beyond communications
  • Review of current research results
  • David J. C. MacKay, "Information Theory, Inference, and Learning Algorithms", Cambridge University Press, 2003
  • Tom Richardson, Rüdiger Urbanke, "Modern Coding Theory", Cambridge University Press, 2008
  • William Ryan, Shu Lin, "Channel Codes - Classical and Modern", Cambridge University Press, 2009
  • Todd K. Moon, “Error Correction Coding – Mathematical Methods and Algorithms”, Wiley Interscience, 2005
Material ILIAS
Example Figure


Fragment of a factor graph illustrating spatially coupled code

Module description in LSF