6.441-10 The channel coding theorem
LECTURE 10Last time:Maximizing capacity: Arimoto-Blahut• Examples• Lecture outlineThe channel coding theorem overview• Upper bound on the error probability• Bound on not being typical • Bound on too many elements being typ₭ ical Coding theorem (weak) • Reading: Reading: Scts. 8.4, 8.7. OverviewConsider a DMC with transition probabilitiie PY X(yx)||For any block length n, let nPYnXn(yxn)= �in =1 PY X(yixi)||||PXn(xn)= �ni=1 PX(xi) PY n(yn)= �ni=1 PY (yi) Let R be an arbitrary rate R 0 and for any rate R
Description
Lecture outline:The channel coding theorem overview,Upper bound on the error probability,Bound on not being typical,Bound on too many elements being typical and Coding theorem (weak). Here we discuss about ,How can we implement coding strategies that are random and how well do they perform? How well do random codebooks perform for finite length codewords?
Instructors: Prof. Muriel Médard, MIT Course Number:6.441 Level: Graduate, 6.441-10 The channel coding theorem, 6.441 Information Theory, Electrical Engineering and Computer Science, Engineering, Massachusetts Institute of Technology: MIT Open Course Ware, http://ocw.mit.edu (11-09-2011).License: Creative Commons BY-NC-SA: http://ocw.mit.edu/terms/#cc".
Presentation Transcript
Your Facebook Friends on WizIQ