Spring 2015

A New Look at Gallager's Bounds

Monday, April 20th, 2015 4:00 pm4:30 pm

Add to Calendar

Over 50 years ago R. Gallager used the probabilistic method to show that good codes exist with parity check matrix that has constant row and column sums. I will present a proof and speak about some possible approaches to the search for improved bounds.