440-4122/01 – Coding Theory (KOD)
Gurantor department | Department of Telecommunications | Credits | 4 |
Subject guarantor | Ing. Pavol Partila, Ph.D. | Subject version guarantor | Ing. Pavol Partila, Ph.D. |
Study level | undergraduate or graduate | Requirement | Optional |
Year | 2 | Semester | summer |
| | Study language | Czech |
Year of introduction | 2016/2017 | Year of cancellation | |
Intended for the faculties | FEI | Intended for study types | Follow-up Master |
Subject aims expressed by acquired skills and competences
Learning outcomes are set so that the students are able to identify and apply tasks in the field of coding information with respect to the reliability of information transmission.
Teaching methods
Lectures
Tutorials
Summary
The aim of this subject is theory of coding information, error detection code and erorr corection code. In detail, student will be able to:
• design own a block and none-block code,
• use the basic Huffman algorithm,
• understand conditions of detection and error correction code,
• understand the principle of linear code,
• generate the code word of linear code,
• understand the decoding of linear code and detection and correction of error,
• understand the significance of cyclic code for information transmission,
• understand the detection of error on the base of probability,
• understand Viterbi algorithm,
• understand the linear network code.
Compulsory literature:
Recommended literature:
Additional study materials
Way of continuous check of knowledge in the course of semester
Discussion about individual codes.
E-learning
Other requirements
No additional requirements are placed on the student.
Prerequisities
Subject has no prerequisities.
Co-requisities
Subject has no co-requisities.
Subject syllabus:
Lectures:
• Coding of information.
• Block and none-block code, prefix code, Huffman code.
• Linear code and its conditions, perfect code, parity code.
• Hamming code, construction of codes.
• Cyclic code.
• BCH code.
• Reed-Solomon code.
• Convolutional code, Viterbi decoding algorithm.
• Turbo code.
• Linear network coding.
Conditions for subject completion
Occurrence in study plans
Occurrence in special blocks
Assessment of instruction
Předmět neobsahuje žádné hodnocení.