Theory of Codes B

Lecturer:

Jan Mareš (gar.)

Tutor:

Jan Mareš (gar.)

Supervisor:

Department of Mathematics

Synopsis:

Coding of the source of information, the shortest code, entropy. Error detecting and error correcting codes - algebraic methods.

Requirements:

Syllabus of lectures:

Coding and codes, prefix codes, Kraft?s inequality, McMillan?s theorem, the shortest code, entropy as a measure of information. Error detecting and error correcting codes, minimum distance of a code, information and parity check symbols, coding information symbols, linear codes, generation and parity check matrices, standard decoding, Hamming codes, cyclic 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:

Povinná

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

Doporučená

Guiasu S.: Information Theory with Applications. McGraw-Hill, New York, 1977.

Note:

Time-table for winter semester 2011/2012:

Time-table is not available yet

Time-table for summer semester 2011/2012:

Time-table is not available yet

The course is a part of the following study plans: