Theory of Codes

Course guarantor:

Lecturer:

Tutor:

Supervisor:

Department of Mathematics

Synopsis:

Algebraic methods used in error detecting and error correcting codes.

Requirements:

Basic results and techniques of the linear and general algebra, particularly, of finite fields.

Syllabus of lectures:

Error detecting and error correcting codes, minimum distance of a code, the Hamming bound.

Codes with the best parameters, the Hadamard matrices, Levenshtein theorem.

Linear codes: generator and parity check matrices, standard decoding, Hamming codes, Golay code, cyclic codes, BCH codes, Reed-Muller codes.

Syllabus of tutorials:

Study Objective:

To acquaint students with using results of linear and general algebra for creating error detecting and error correcting codes and their decoding methods.

Study materials:

Obligatory:

Blahut R.E.: Theory and Practice of Error Control Codes. Addison-Wesley, Massachusetts, 1984.

Optional:

F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland: New York, NY, 1978.

Note:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans: