On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes

摘要

We would like to better understand the fundamental cone of Tanner graphs derived from finite projective planes. Towards this goal, we discuss some new results on minimal pseudo-codewords of such Tanner graphs. Our results consist of bounds on the AWGNC and BSC pseudo-weight, on one hand, and of a study of the structure of minimal pseudo-codewords, on the other.