Pseudo-Codeword Analysis of Tanner Graphs from Projective and Euclidean Planes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In order to understand the performance of a code under maximum-likelihood (ML) decoding, one studies the codewords, in particular the minimal codewords, and their Hamming weights. In the context of linear programming (LP) decoding, one's attention needs to be shifted to the pseudo-codewords, in particular to the minimal pseudo-codewords, and their pseudo-weights. In this paper we investigate some families of codes that have good properties under LP decoding, namely certain families of low-density parity-check (LDPC) codes that are derived from projective and Euclidean planes: we study the structure of their minimal pseudo-codewords and give lower bounds on their pseudo-weight.
Submitted to IEEE Transactions on Information Theory, February 25, 2006

Keywords

Information Theory, Discrete Mathematics

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0602089
 http://arxiv.org/abs/cs/0602089

Collections

arXiv