University of Tartu - ©2011 Rafik Chaabouni - Last update: 24.03.2013 20:04
Date: 28/03/2013 Location: J. Liivi 2, room 317 (next to the coffee room)
Speaker: Vitaly Skachek
Title: Correction of errors in linear time using expander graphs
The talk is based on:
Michael Sipser and Daniel A. Spielman, "Expander Codes",
IEEE Transactions on Information Theory, vol. 42, no. 6,
pp. 1710-1722, 1996.
Abstract:
In this talk, we present a family of Low-Density Parity- Check (LDPC) codes constructed using expander graphs. By using expansion properties of the graphs, we show that there exist a simple decoding algorithm, which corrects a fraction of errors proportional to the length of the code in linear time.