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

Simple item page
dc.creatorSmarandache, Roxana
dc.creatorVontobel, Pascal O.
dc.date2006-02-26
dc.date.accessioned2026-07-07T08:16:23Z
dc.date.available2026-07-07T08:16:23Z
dc.descriptionIn 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.
dc.descriptionSubmitted to IEEE Transactions on Information Theory, February 25, 2006
dc.identifierhttps://arxiv.org/abs/cs/0602089
dc.identifierhttp://arxiv.org/abs/cs/0602089
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133760
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.titlePseudo-Codeword Analysis of Tanner Graphs from Projective and Euclidean Planes
dc.typetext

Files

Collections

arXiv