Lab Home | Phone | Search | ||||||||
|
||||||||
I will continue with the theory of graphical codes. I will give a synopsis of the analysis of low-density parity-check codes under iterative decoding algorithms. A key focus of modern coding theory is to study the interplay between the graphical structure of a code and its decoding performance. I will then focus on the particular structure which emerges when codes are "coupled". We call these "spatially coupled codes". I will demonstrate that these codes hold the promise of achieving simultaneous dreams of near Shannon limit performance, good finite-length performance, practical implementability and universality (same code to be used irrespective of the nature of noisy channel). Host: Peter Loxley, loxley@lanl.gov |