Show/hide contentOpenClose All
Curricular information is subject to change
Upon successful completion of this module, students should be:
able to represent rank metric codes in a variety of ways, such as via linearlized polynomials, as matrices and in vector form;
understand the how rank metric codes can be applied to error-correction in network coding
knowledgable of the duality theory of rank metric codes;
familiar with bounds associated with rank metric codes, such as those related to its covering radius and minimum distance;
familiar with the main classes of maximum rank metric codes;
familiar with decoding methods of generalized Gabidulin codes;
| Student Effort Type | Hours |
|---|---|
| Lectures | 36 |
| Total | 36 |
Not applicable to this module.
| Description | % of Final Grade | Timing |
|---|---|---|
| Examination: < Description > | 100 |
3 hour End of Trimester Exam |
Compensation
This module is not passable by compensation
Resit Opportunities
End of Semester Exam
Remediation
exam