|
|
MIT Electrical Engineering and Computer Science
EECS Event |
Tuesday, December 11, 2001
4:00 PM (reception following)
Room 35-225
LIDS Colloquium
Abstract
It is by now well understood how to design LONG codes which approach the capacity of various channels. In many cases though one is interested in fairly short block lengths and stringent bit/block error requirements. In this regime the standard approach of density evolution has little to contribute to the design problem.
In this talk I will introduce a new approach to the FINITE length analysis of LDPC codes. Although this new analysis is motivated by the BEC, it is becoming more and more apparent that it can also be a valueable tool in the more general setting. I will also discuss the many open problems in this area.
(based on joint work with C. Di, T. Richardson, A. Shokrollahi, E. Telatar)