Universal Schemes in Information Theory
Download as PDF
Course Description
Universal schemes for lossless and lossy compression, channel coding and decoding, prediction, denoising, and filtering. Characterization of performance limitations in the stochastic settting: entropy rate, rate-distortion function, channel capacity, Bayes envelope for prediction, denoising, and filtering. Lempel-Ziv lossless compression, and Lempel-Ziv based schemes for lossy compression, channel coding, prediction, and filtering. Discrete universal denoising. Compression-based approach to denoising. The compound decision problem. Prerequisites: EE276 (Formerly EE376A).
Grading Basis
ROP - Letter or Credit/No Credit
Min
3
Max
3
Course Repeatable for Degree Credit?
No
Course Component
Lecture
Enrollment Optional?
No
Programs
EE376C
is a
completion requirement
for:
- (from the following course set: )
- (from the following course set: )