Abstract
A central theme of current research in coding theory are low density parity-check (LDPC) codes and more generally codes defined via graphs. There exist various decoding algorithms which work in a decentralized manner and which can be viewed as discrete dynamical systems. In this talk, we explain these algorithms from a systems theoretic point of view.