Logo

Mathematical Sciences Research Institute

Home » Workshop » Schedules » How close to Maximum Likelihood is iterative (Turb) Decoding?

How close to Maximum Likelihood is iterative (Turb) Decoding?

Combinatorial Game Theory Research Workshop July 24, 2000 - July 28, 2000

July 28, 2000 (12:55 AM PDT - 01:25 AM PDT)
Speaker(s): Robert McEliece
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

104-12834-How Close to Maximum Likelihood is Iterative (Turbo) Decoding?-Robert McEliece

Abstract No Abstract Uploaded
Supplements No Notes/Supplements Uploaded
Video/Audio Files

104-12834-How Close to Maximum Likelihood is Iterative (Turbo) Decoding?-Robert McEliece

H.264 Video 104-12834-How_Close_to_Maximum_Likelihood_is_Iterative_(Turbo)_Decoding_-Robert_McEliece.mp4 48.1 MB video/mp4 Download
104-12834-How_Close_to_Maximum_Likelihood_is_Iterative_(Turbo)_Decoding_-Robert_McEliece.rm 16.5 MB application/vnd.rn-realmedia Download
Buy the DVD

If none of the options work for you, you can always buy the DVD of this lecture. The videos are sold at cost for $20USD (shipping included). Please Click Here to send an email to MSRI to purchase the DVD.

See more of our Streaming videos on our main VMath Videos page.