On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes
<|reference_start|>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 bounds on the AWGNC and BSC pseudo-weight of minimal pseudo-codewords of such Tanner graphs, on one hand, and study the structure of minimal pseudo-codewords, on the other.<|reference_end|>
@article{vontobel2005on,
    title={On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes},
    author={Pascal O. Vontobel, Roxana Smarandache},
    journal={Proc. 43rd Allerton Conference on Communications, Control, and
  Computing, Allerton House, Monticello, Illinois, USA, Sept. 28-30, 2005},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0510043},
    primaryClass={cs.IT cs.DM math.IT}
}