Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes
From MaRDI portal
Publication:3549028
DOI10.1109/TIT.2007.899563zbMATH Open1326.94049arXivcs/0602089MaRDI QIDQ3549028FDOQ3549028
Authors: Roxana Smarandache, Pascal O. Vontobel 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/cs/0602089
Cited In (2)
This page was built for publication: Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549028)
