Graph based codes allow us to visualize codes and can construct systems of decoding. In graph-based decoding of error correcting codes, it is possible to run into roadblocks called stopping sets which prevent further error correction. How could we construct encoding methods which avoid these roadblocks? We investigate a setting where we must look at partitions of variable nodes with the goal of avoiding stopping sets in at least one part. We examine a particular example with 6 vertices represented by a Tanner graph and corresponding parity check matrix.
