Vertex Packing Decoding

In this work, we present a new framework for developing decoding algorithms for linear block codes. We define a new graphical model, called configuration graph and show that maximum likelihood (ML) sequence decoding can be performed by finding a maximum vertex packing on a configuration graph. We present examples of low-cost decoding algorithms developed using this graphical model and show that remarkable performance improvements can be achieved especially by combining these algorithms with belief propagation (BP) decoding for Low Density Parity Check (LDPC) codes.