Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
en:output:presentations:ldpc [2017/03/09 11:55]
romon
en:output:presentations:ldpc [2017/05/04 11:43] (current)
romon
Line 9: Line 9:
 </​presentation>​ </​presentation>​
  
-<​presentation:​ Rank of Random Matrices over Finite Fields | A. Shokrollahi | Antalya Algebra Days XI, Antalya University, 2010 | +<​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 19: Line 19:
 </​presentation>​ </​presentation>​
  
-<​presentation:​ Capacity Achieving Sequences for the Erasure Channel | A. Shokrollahi | Presentation at ISIT | {{ :​en:​output:​presentations:​isit01_ldpc.pdf |}}>+<​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. Talk on systematic study of capacity-achieving (ca) sequences of low-density parity-check codes for the erasure channel.
 </​presentation>​ </​presentation>​
Line 27: Line 27:
 </​presentation>​ </​presentation>​
  
-<​presentation:​ Antenna Diagonal Space-Time Codes from Representations of SU(2)| A. Shokrollahi | Presentation at ISIT | {{ :​en:​output:​presentations:​isit01_su2.pdf |}}>+<​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. Talk on how good 4-antenna differential unitary space-time codes can be constructed.
 </​presentation>​ </​presentation>​
  
-<​presentation:​ Packing Unitary Matrices | A. Shokrollahi | Presentation at ISIT | {{ :​en:​output:​presentations:​isit01_talk2.pdf |}}>+<​presentation:​ Packing Unitary Matrices | A. Shokrollahi | Presentation at ISIT, 2001 | {{ :​en:​output:​presentations:​isit01_talk2.pdf |}}>
 </​presentation>​ </​presentation>​
  
-<​presentation:​ Computing the Performance of Group Space Time Codes from their Character Table | A. Shokrollahi | Presentation at ISIT | {{ :​en:​output:​presentations:​isit01_2.pdf |}}>+<​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. 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 49: 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 63: Line 67:
 <​presentation:​ Introduction to Low-Density Parity-Check Codes| A. Shokrollahi | |{{ :​en:​output:​presentations:​livecodes.pdf |}}> <​presentation:​ Introduction to Low-Density Parity-Check Codes| A. Shokrollahi | |{{ :​en:​output:​presentations:​livecodes.pdf |}}>
 Design of codes for LIVE streaming Design of codes for LIVE streaming
 +</​presentation>​
 +
 +<​presentation:​ Low-Density Codes and the Erasure Channel | A. Shokrollahi | | {{ :​en:​output:​presentations:​minnesota.pdf |}}>
 </​presentation>​ </​presentation>​