| Educational guide School of Engineering |
english |
| Bachelor's Degree in Computer engineering (2010) |
 Subjects |
| DISCRETE MATHEMATICS II |
| Contents |
| IDENTIFYING DATA | 2020_21 |
| Subject | DISCRETE MATHEMATICS II | Code | 17234010 | |||||
| Study programme |
|
Cycle | 1st | |||||
| Descriptors | Credits | Type | Year | Period | ||||
| 6 | Basic Course | Second | 2Q |
|||||
| Competences | Learning outcomes | Contents |
| Planning | Methodologies | Personalized attention |
| Assessment | Sources of information | Recommendations |
| Topic | Sub-topic |
| Finite arithmetic and finite fields | Divisibility, prime numbers, greatest common divisor. Bézout's identity and Euclidean algorithm. Congruences. Modular rings Zm. Polynomials, polynomial divisibility, primitive elements. Finite fields. |
| Information coding (classical) |
Information theory. Noisy channels. Bloc codes. Hamming distance. Code length and correcting capability. Bounds. Linear codes. Generator matrix and parity check matrix. Error correction by syndrome. Cyclic codes. Generator polynomial. Vandermonde matrices. Algebraic codes. Reed-Solomon codes. |
| Information coding (advanced) |
