This lecture allows us to examine the asymptotic performance of codes, prove some simple negative results concerning the parameters of codes, and analyze random and greedy codes.
Please be advised that external sites may have terms and conditions,
including license rights, that differ from ours. MIT OCW is not responsible
for any content on third party sites, nor does a link suggest an endorsement
of those sites and/or their content.