Algebraic Coding Theory

About this course

Construct linear codes, cyclic codes (BCH, Reed-Solomon), and LDPC codes. Analyze minimum distance, decoding algorithms, and error performance bounds (Singleton, Plotkin, Hamming bounds).

• 20 lessons
• 2 h
• advanced

What you'll learn

• Explain the necessity of error correction in digital communication
• Define basic terminology: messages, codewords, encoding, decoding
• Define a linear code over a finite field
• Construct generator and parity-check matrices
• Relate code parameters to matrix dimensions
• Compute the minimum distance of a linear code

Finishing the course

• 80 knowledge-check questions along the way, so you know the ideas stuck before you move on.
• Watching is free and needs no account. Sign in to save your progress. Pass each lesson's quiz (60%+) to earn the certificate. Each certificate has its own public verification link to share, marked quiz-verified.

Created by