A tantárgyleírás hatályossága
Hatályosság kezdete:
2026. March 21.
Hatályosság vége:
—
| Subject name (Hungarian, English) |
Kódolástechnika
Coding Technology
|
||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Subject code | BMEVIHIAB04 | ||||||||||||
| Subject type | — | ||||||||||||
| Training Level | — | ||||||||||||
| Course types and hours (weekly/semester) |
|
||||||||||||
| Assessment type | vizsga | ||||||||||||
| Credits | 4 | ||||||||||||
| Subject coordinator |
DR. Levendovszky János
position: egyetemi tanár
contact:
levendovszky.janos@vik.bme.hu
|
||||||||||||
| Responsible department |
Hálózati Rendszerek és Szolgáltatások Tanszék
|
||||||||||||
| Faculty | Villamosmérnöki és Informatikai Kar | ||||||||||||
| Subject website | — | ||||||||||||
| Primary curriculum type | — | ||||||||||||
| Direct prerequisites – Strong prerequisite | none | ||||||||||||
| Direct prerequisites – Weak prerequisite | none | ||||||||||||
| Direct prerequisites – Parallel prerequisite | none | ||||||||||||
| Direct prerequisites – Milestone prerequisite | none | ||||||||||||
| Direct prerequisites – Exclusion | none |
Objectives
Programme
Error-correcting coding: binary channel model, error probability, basic coding concepts (geometric interpretation, code spacing, optimal codes, code spacing), general coding scheme and its complexity. Singleton and Hamming bounds. Binary linear code, generator matrix, parity check matrix, systematic code. Hamming code, Standard Array. Error correcting performance and relation between column vectors of parity check matrix. Prime and prime-power size Galois fields, operations on prime-power Galois fields with shift registers. Nonbinary codes, Hamming codes, Reed-Solomon codes. Cyclic linear codes, generator and parity check polynomials. Error trapping algorithm. Minimal polynomials over Galois fields of prime power, BCH codes.
Data compression - source coding: prefix codes, average code word length and entropy. Shannon-Fano code. Binary Huffmann code. Distribution free coding: Adaptive Huffman codes, Lempel-Ziv codes. Predictive coding. Speech and voice compression algorithms. Image and video compression algorithms.
Cryptography – data security: basic concepts: sensitive information and its attack, cryptography (symmetric, asymmetric). Cryptographic techniques, key-stream and block cryptographs. Shift cryptography, polyalphabetic cryptography, affine cryptography, LFSR
based key stream cryptography, DES block cryptography, 3DES and AES ciphers, SSL protocol. OTP algorithm. Fundamentals of number theory. Public key cryptography. The RSA algorithm and its application.
Topics for the practices
Error correcting coding:
Tasks related to binary linear coding, Reed-Solomon codes, code combinations, applications in communication technologies, network coding, QoS communication
Data compression and source coding:
Examples for Huffman, Shannon-Fano, Sahnnon-Fano-Elias for codes, Adaptive Huffman coding, LZ family of algorithms for file compression, Adaptive predictive coding, Transform based compression (KLT and PCA)
Data security coding:
Examples of OTP algorithm, RSA algorithm
Data compression - source coding: prefix codes, average code word length and entropy. Shannon-Fano code. Binary Huffmann code. Distribution free coding: Adaptive Huffman codes, Lempel-Ziv codes. Predictive coding. Speech and voice compression algorithms. Image and video compression algorithms.
Cryptography – data security: basic concepts: sensitive information and its attack, cryptography (symmetric, asymmetric). Cryptographic techniques, key-stream and block cryptographs. Shift cryptography, polyalphabetic cryptography, affine cryptography, LFSR
based key stream cryptography, DES block cryptography, 3DES and AES ciphers, SSL protocol. OTP algorithm. Fundamentals of number theory. Public key cryptography. The RSA algorithm and its application.
Topics for the practices
Error correcting coding:
Tasks related to binary linear coding, Reed-Solomon codes, code combinations, applications in communication technologies, network coding, QoS communication
Data compression and source coding:
Examples for Huffman, Shannon-Fano, Sahnnon-Fano-Elias for codes, Adaptive Huffman coding, LZ family of algorithms for file compression, Adaptive predictive coding, Transform based compression (KLT and PCA)
Data security coding:
Examples of OTP algorithm, RSA algorithm
The aim of this course is to describe the main algorithms for the three basic coding tasks involved in the storage and transmission of information. These areas are related to (i) the transmission of information over unreliable communication channels or storage on unreliable storage (error-correcting coding), (ii) the representation of information in a smaller size (data compression, source coding), and (iii) the protection of sensitive information against intelligent attackers when transmitted over public channels (data security, cryptography)
Learning outcomes
Ez a tantárgy a KKK rendeletben meghatározott, következő kompetenciák fejlesztését szolgálja:
Knowledge
No learning outcomes recorded.
Skills
No learning outcomes recorded.
Attitudes
No learning outcomes recorded.
Autonomy and responsibility
No learning outcomes recorded.
Oktatási módszertan
In lectures: general discussion of coding algorithms,
In practices: applying the theoretical material through numerical examples and real applications.
Tanulástámogató anyagok
Online források
• D. Costello: Error control codes, Wiley, 2005; • S. Verdu, S. Mclaughlin: Information Theory: 50 years of discovery, IEEE, 1999 ; • J.G. Proakis: Digital communications,McGraw Hill, 1996; • T.M. Cover, A.J. Thomas: Elements of Information Theory, John Wiley, 1991. (IT)
Recommended preliminary knowledge for completing the subject
Knowledge type competencies
(azon előzetes ismeretek összessége, amelyek megléte nem kötelező, de a tantárgy eredményes teljesítését nagyban elősegíti)
Introduction to discrete mathematics 1-2
Skill type competencies
(azon előzetes képességek és készségek összessége, amelyek megléte nem kötelező, de a tantárgy eredményes teljesítését nagyban elősegíti)
nincs
Recommended (non-compulsory) preliminary competencies
(azon ajánlott (nem kötelező) előzetesen megszerzendő kompetenciák összessége, amelyek jelentősen hozzájárulnak a tantárgy eredményes teljesítéséhez)
Introduction to discrete mathematics 1-2
General rules
Requirements:
During the semester, 1 successful (at least 40%) mid-term test for the signature
Exam Successful exam (at least 40%)
Elégtelen
Elégséges
Közepes
Jó
Jeles
0-39 pont
40-53 pont
54-67 pont
68-81 pont
82-100 pont
Additional possibilities:
Retake in the semester and Re-re-take in the catch-up week, retake of the exam
Assessment methods
In-term assessments
No detailed assessments provided.
Weight of in-term assessments
No weights provided.
Exam-period assessments
No detailed assessments provided.
Weight of exam elements
No weights provided.
Grade calculation
No grade thresholds provided.
Attendance requirements
No attendance requirements provided.
Rules for retake and resubmission
Not provided.
Short description
Not provided.
Detailed description
Not provided.
Recommended courses
Analysis 1-2
Workload to complete the subject
No workload breakdown provided.
Validity of subject requirements
Requirements valid from:
—
Requirements valid until:
—
Curriculum placement
No curriculum placements recorded for this subject version.