====LDPC Codes==== /* template: ABSTRACT */ Introduction to coding theory using graphs. Talk on systematic study of capacity-achieving (ca) sequences of low-density parity-check codes for the erasure channel. 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 Talk on how good 4-antenna differential unitary space-time codes can be constructed. Talk on compute upper bounds on the pairwise probability of error unitary differential space-time codes that form a finite group under matrix multiplication. Introduction to coding theory using graphs. 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. 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. Design of codes for LIVE streaming