
Abstract
This talk will outline a recent set of ideas on using spatially coupled ensembles to deduce properties of the underlying non-coupled ensemble. An application is a complete proof of the replica symmetric formula for conditional entropy of regular Low-Density-Parity-Check code ensembles on arbitrary binary input memoryless channels, as well as a proof of the Maxwell area construction for such systems. Applications to other problems and phase transitions will be discussed time permitting.