Introduction to Information Theory

CT Score

1500

#0 of 0 in ENG EC

Difficulty

—/10

Workload

—h/wk

Median grade

—

from grade distribution

Would take again

—

n = 0 verified

Grade distribution

No distribution published for this course.

By professor: same course, different game

PROFESSORSCOREGRADEHRS/WKTERMS

Professor ratings →

Sections

No section data for this term yet.

In the tree

(ENGEK381) - Discrete memoryless stationary sources and channels; Information measures on discrete and continuous alphabets and their properties: entropy, conditional entropy, relative entropy, mutual information, differential entropy; Elementary constrained convex optimization; Fundamental information inequalities: data-processing, and Fano's; Block source coding with outage: weak law of large numbers, entropically typical sequences and typical sets, asymptotic equipartition property; Block channel coding with and without cost constraints: jointly typical sequences, channel capacity, random coding, Shannon's channel coding theorem, introduction to practical linear block codes; Rate-distortion theory: Shannon's block source coding theorem relative to a fidelity criterion; Source and channel coding for Gaussian sources and channels and parallel Gaussian sources and channels (water-filling and reverse water-filling); Shannon's source-channel separation theorem for point-to-point communication; Lossless data compression: Kraft's inequality, Shannon's lossless source coding theorem, variable-length source codes including Huffman, Shannon-Fano-Elias, and Arithmetic codes; Applications; Mini course-project→ENG EC 517→unlocks 0 courses

No mapped courses require this one yet. See on the map →

Study groups

0 active

🔒 Verified-only writes. You post as “sophomore, lecture section”: real enough to trust, anonymous enough to be honest.