This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
en:output:presentations:ldpc [2017/03/02 12:05] romon |
en:output:presentations:ldpc [2017/05/04 11:43] (current) romon |
||
|---|---|---|---|
| Line 6: | Line 6: | ||
| */ | */ | ||
| - | <presentation: Rank of Random Matrices over Finite Fields | A. Shokrollahi | Antalya Algebra Days XI, Antalya University, 2010 | | + | <presentation: Low-Complexity Capacity-Achieving Erasure Codes | A. Shokrollahi | AAECC, Honolulu, 2013 |{{ :en:output:presentations:aaecc13.pdf |}}> |
| + | </presentation> | ||
| + | |||
| + | <presentation: Rank of Random Matrices over Finite Fields | A. Shokrollahi | Antalya Algebra Days XI, Antalya University, 2010 | {{ :en:output:presentations:antalya-2010.pdf |}}> | ||
| </presentation> | </presentation> | ||
| Line 14: | Line 17: | ||
| <presentation: Efficient Content Delivery using Codes | A. Shokrollahi | Presentation at Communication Theory Workshop, Florida, 2002 | {{ :en:output:presentations:ctw02.pdf |}}> | <presentation: Efficient Content Delivery using Codes | A. Shokrollahi | Presentation at Communication Theory Workshop, Florida, 2002 | {{ :en:output:presentations:ctw02.pdf |}}> | ||
| + | </presentation> | ||
| + | |||
| + | <presentation: Capacity Achieving Sequences for the Erasure Channel | A. Shokrollahi | Presentation at ISIT, 2001 | {{ :en:output:presentations:isit01_ldpc.pdf |}}> | ||
| + | Talk on systematic study of capacity-achieving (ca) sequences of low-density parity-check codes for the erasure channel. | ||
| + | </presentation> | ||
| + | |||
| + | <presentation: Antenna Diagonal Space-Time Codes and Continued Fractions | A. Shokrollahi | Presentation at ISIT, 2001 | {{ :en:output:presentations:isit01.pdf |}}> | ||
| + | We establish a relationship between op-timization of the diversity product for two-antenna - - diagonal space-time codes and the elementary theory of continued fractions | ||
| + | </presentation> | ||
| + | |||
| + | <presentation: Antenna Diagonal Space-Time Codes from Representations of SU(2)| A. Shokrollahi | Presentation at ISIT, 2001 | {{ :en:output:presentations:isit01_su2.pdf |}}> | ||
| + | Talk on how good 4-antenna differential unitary space-time codes can be constructed. | ||
| + | </presentation> | ||
| + | |||
| + | <presentation: Packing Unitary Matrices | A. Shokrollahi | Presentation at ISIT, 2001 | {{ :en:output:presentations:isit01_talk2.pdf |}}> | ||
| + | </presentation> | ||
| + | |||
| + | <presentation: Computing the Performance of Group Space Time Codes from their Character Table | A. Shokrollahi | Presentation at ISIT, 2001 | {{ :en:output:presentations:isit01_2.pdf |}}> | ||
| + | Talk on compute upper bounds on the pairwise probability of error unitary differential space-time codes that form a finite group under matrix multiplication. | ||
| + | </presentation> | ||
| + | |||
| + | <presentation: Design of Erasure Codes with Differential Evolution | A. Shokrollahi | Presentation at ISIT, 2000 | {{ :en:output:presentations:isit00.pdf |}}> | ||
| </presentation> | </presentation> | ||
| Line 20: | Line 45: | ||
| <presentation: Interative Decoding of LDPC Codes | A. Shokrollahi | Presentation in Oberwolfach, 2000 |{{ :en:output:presentations:oberwolfach_05.00.pdf |}} > | <presentation: Interative Decoding of LDPC Codes | A. Shokrollahi | Presentation in Oberwolfach, 2000 |{{ :en:output:presentations:oberwolfach_05.00.pdf |}} > | ||
| - | Introduction to coding theory using graphs. | ||
| </presentation> | </presentation> | ||
| Line 28: | Line 52: | ||
| <presentation: Low-Density Low-Complexity Codes | A. Shokrollahi | Presentation at SIAM Annual Meeting, Atlanta, 1999 |{{ :en:output:presentations:siamldpc99.pdf |}} > | <presentation: Low-Density Low-Complexity Codes | A. Shokrollahi | Presentation at SIAM Annual Meeting, Atlanta, 1999 |{{ :en:output:presentations:siamldpc99.pdf |}} > | ||
| + | We will outline in this talk the design and analysis of error-correcting codes that can be encoded and de-coded efficiently and protect against a fraction of errors that is almost as large as given by theoretical upper bounds. | ||
| </presentation> | </presentation> | ||
| Line 34: | Line 59: | ||
| <presentation: An Introduction to Low-Density Parity-Check Codes| A. Shokrollahi | Presentation at Princeton University, USA |{{ :en:output:presentations:princeton.pdf |}}> | <presentation: An Introduction to Low-Density Parity-Check Codes| A. Shokrollahi | Presentation at Princeton University, USA |{{ :en:output:presentations:princeton.pdf |}}> | ||
| + | Design and analysis of error-correctig codes that can be encoded and decoded efficiently and protect against a fraction of errors that is almost as large as given by theoretical upper bounds. | ||
| </presentation> | </presentation> | ||
| <presentation: Efficient Content Delivery and Low Complexity Codes| A. Shokrollahi | Presentation at MSRI, USA |{{ :en:output:presentations:msri.pdf |}}> | <presentation: Efficient Content Delivery and Low Complexity Codes| A. Shokrollahi | Presentation at MSRI, USA |{{ :en:output:presentations:msri.pdf |}}> | ||
| + | </presentation> | ||
| + | |||
| + | <presentation: Introduction to Low-Density Parity-Check Codes| A. Shokrollahi | |{{ :en:output:presentations:livecodes.pdf |}}> | ||
| + | Design of codes for LIVE streaming | ||
| + | </presentation> | ||
| + | |||
| + | <presentation: Low-Density Codes and the Erasure Channel | A. Shokrollahi | | {{ :en:output:presentations:minnesota.pdf |}}> | ||
| </presentation> | </presentation> | ||