Lecture Notes
Memory-less sources, prefix free codes, and entropy
Description:
Lecture presentation on discrete memoryless sources (DMS), the Huffman coding algorithm, discrete source coding, the weak law of large numbers (WLLN), the asymptotic equipartition property (AEP), Fixed-to-fixed-length source codes, and Kraft inequality for unique decodability.
Resource Type:
Lecture Notes
pdf
262 kB
Memory-less sources, prefix free codes, and entropy
Course Info
Instructors
Departments
As Taught In
Fall
2009
Level
Course Info
Instructors
Departments
As Taught In
Fall
2009
Level
Learning Resource Types
grading
Exams
notes
Lecture Notes
assignment
Problem Sets
