This course is to introduce basic notions in the theory of error-correcting codes which is used in data storage and telecommunication.
* Error detection, correction and decoding, Hamming distance
* Basic facts on finite fields
* Linear codes, Hamming weight, generator and parity-check matrices, encoding, decoding.
* Bounds, Hamming codes, Golay codes, perfect codes, MDS codes
* Construction of codes, Reed-Muller codes.
* Cyclic codes, generator polynomials, BCH codes, Reed-Solomon codes
* Computer implementation of efficient coding and decoding.
| AUs | 4.0 AUs |
| Grade Type | |
| Prerequisite | MH1301, MH2200 |
| Exam | 2 December 2026, 1.00 pm - 3.00 pm |
The Exam information shown may be subject to changes. Students are to check the finalised exam timetable with exam seat information, which will be available at the 'Examination Seating Arrangement' webpage, 2 weeks before start of examination.
Prerequisite Graph
Coding Theory
Unlocks
Available Indexes
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 1030 | COMMON LEC (LE) 1030-1220 Tue SPMS-TR+15 | COMMON LEC (LE) 1030-1120 Thu SPMS-TR+15 | |||
| 1100 | |||||
| 1130 | 70304 TUT (T) 1130-1220 Thu SPMS-TR+15 | ||||
| 1200 |