On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
This paper is a slightly reformulated version of the paper that appeared in the proceedings of the 43rd Allerton Conference on Communications, Control, and Computing, Allerton House, Monticello, Illinois, USA, Sept. 28-30, 2005

Keywords

Information Theory, Discrete Mathematics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/134244

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0510043
 http://arxiv.org/abs/cs/0510043
 Proc. 43rd Allerton Conference on Communications, Control, and Computing, Allerton House, Monticello, Illinois, USA, Sept. 28-30, 2005

Collections

arXiv