Czech

Not applicable.

Students who are going to attends this course should have a full knowledge of selected topics in mathematics, in particular: solving the equations and non-equations with logarithms, matrix calculation, especially vector multiplication with a matrix, know arithmetic operations with polynomials, in particular dividing, conversion into the binary numerical system and calculations in binary numerical system. Students should have experience of creating simple functions in MATLAB.

At the end of each laboratory or computer exercise the teacher checks the results of the given assignment and awards points. Assessment of computer exercises also includes assessment of homeworks. The points awarded for laboratory and computer exercises (a maximum of 30 points in a semester) go to the evaluation of the examination and thus also the assessment. The exam is written. The maximum number of points is 70. The overall evaluation is the sum of points for computer exercises, laboratories and a written exam. The minimum feasible value is 50 points; the maximum value is 100 points.
Attendance at laboratory and computer exercises is compulsory, justified absence can be made up for after prior arrangement with the instructor. The content and forms of instruction in the evaluated course are specified by a regulation issued by the lecturer responsible for the course and updated for every academic year.

The aim of the course is to introduce students to the basic knowledge of data communication, tools for its realization and the conditions of its realization in contemporary as well as prospective telecommunication systems.
Students who complete this course are able to:
- explain the concepts of information, information content and redundancy
- evaluate the static properties of the information source, in particular redundancy, and propose an appropriate code to reduce redundancy
- explain the concept of channel capacity, the Shannon-Hartley theorem, and determine it for discrete and analog channels
- describe the principle of FEC and ARQ systems
- explain the principle of error protection using codes
- explain the concepts of the Hamming distance and weight
- determine the detection and correction capabilities of code
- explain the principle of security using block, cyclic, tree and concatenated codes
- secure data by the previously mentioned codes based on the specified generation matrix or polynomial
- find the encoder and the decoder diagram of the block, cyclic or tree code
- draw a tree diagram, trellis diagram and state diagram of the tree code
- describe the principle of the Viterbi decoding algorithm
- list the transmission methods in the base-band and pass-band
- list and describe some line codes and their utilization
- list and describe the basic keying methods and combined keying methods
- list and describe the principle of single carrier and multicarrier transmission with application examples
- list the basic concepts of data encryption and cryptographic systems
- list the services provided by cryptographic systems
- describe and compare symmetric and asymmetric cryptographic systems

Not applicable.

Not applicable.

ŠILHAVÝ, P. Datová komunikace - Laboratorní cvičení. Brno: Vysoké učení technické v Brně, 2013. s. 1-84. ISBN: 978-80-214-4725-7. (CS)
ŠILHAVÝ, P. Datová komunikace. Brno: Vysoké učení technické v Brně, 2012. s. 1-211. ISBN: 978-80-214-4455-3. (CS)

BIGGS, Norman L. Codes : an introduction to information communication and cryptography. London : Springer, 2008. 273 s. ISBN 978-184-8002-722. (EN)
MORELOS-ZARAGOZA, Robert H. The art of error correcting coding. Chichester : John Wiley & Sons, 2002. 221 s. ISBN 04-714-9581-6. (EN)
SKALAR, B.. Digital Communications, Fundamentals and applications, Prentice-Hall, 2003, ISBN 0-13-084788-7. (EN)