UnivIS
Information system of Friedrich-Alexander-University Erlangen-Nuremberg © Config eG 
FAU Logo
  Collection/class schedule    module collection Home  |  Legal Matters  |  Contact  |  Help    
search:      semester:   
 
 Layout
 
printable version

 
 
 Also in UnivIS
 
course list

lecture directory

 
 
events calendar

job offers

furniture and equipment offers

 
 
Computational Engineering (Rechnergestütztes Ingenieurwesen) (Master of Science) >>

  Information Theory and Coding (ITC)

Lecturers
Prof. Dr.-Ing. Ralf Müller, Dr.-Ing. Ali Bereyhi

Details
Vorlesung
Online/Präsenz
3 cred.h, ECTS studies, ECTS credits: 5
nur Fachstudium, Sprache Englisch
Time and place: Mon 8:15 - 9:45, H11; Fri 8:15 - 9:45, 04.023

Fields of study
WF EEI-BA 5-6
PF EEI-MA-INT 1-4
PF CE-BA-TA-IT 5
WF CE-MA-TA-IT 1
PF EEI-BA-INT 5-6
WF IuK-BA 5
PF ICT-MA-NDC 1-4
WPF ICT-MA-ES 1-4
WPF ICT-MA-MPS 1-4
WPF WING-BA-IKS-ING-MG1 5-6
WPF WING-MA 1-3
WPF WING-MA-ET-IT 1-3
WPF WING-BA-ET-IT 5-6
PF CME-MA 1
PF ASC-MA 1
WPF INF-NF-EEI 1-4

Contents
Introduction to coding and information theory (binomial distribution, (7,4)-Hamming code, parity-check matrix, generator matrix); Probability, entropy, and inference (entropy, conditional probability, Bayes’ law, likelihood, Jensen’s inequality); Inference (inverse probability, statistical inference); Source coding theorem (information content, typical sequences, Chebychev inequality, law of large numbers); Symbol codes (unique decidability, expected codeword length, prefix-free codes, Kraft inequality, Huffman coding); Stream codes (arithmetic coding, Lempel-Ziv coding, Burrows-Wheeler transform); Dependent random variables (mutual information, data processing lemma); Communication over a noisy channel (discrete memory-less channel, channel coding theorem, channel capacity); Noisy-channel coding theorem (jointly-typical sequences, proof of the channel coding theorem, proof of converse, symmetric channels); Gaussian channel (AWGN channel, multivariate Gaussian pdf, capacity of AWGN channel); Binary codes (minimum distance, perfect codes, why perfect codes are bad, why distance isn’t everything); Message passing (distributed counting, path counting, low-cost path, min-sum (=Viterbi) algorithm); Marginalization in graphs (factor graphs, sum-product algorithm); Low-density parity-check codes (density evolution, check node degree, regular vs. irregular codes, girth); Lossy source coding (transform coding and JPEG compression)

ECTS information:
Credits: 5

Additional information
Expected participants: 85
www: https://www.studon.fau.de/crs4039883.html
Registration is required for this lecture.
Die Registration via: StudOn

Assigned lectures
UE ([hybrid]):Tutorial for Information Theory and Coding
Lecturer: Dr.-Ing. Ali Bereyhi
Time and place:
www: https://www.studon.fau.de/crs4039883.html

Verwendung in folgenden UnivIS-Modulen
Startsemester WS 2021/2022:
Information Theory and Coding (ITC)

Department: Institute for Digital Communications (IDC) (Prof. Dr. Schober)
UnivIS is a product of Config eG, Buckenhof