Pseudocodewords of Tanner Graphs

DOI10.1109/TIT.2007.907501zbMath1325.94161arXivcs/0504013OpenAlexW2116815462MaRDI QIDQ3548985

Deepak Sridhara, Christine A. Kelley

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0504013

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Decoding (94B35)

Related Items (4)

Extremal absorbing sets in low-density parity-check codes ⋮ Pseudocodeword-free criterion for codes with cycle-free Tanner graph ⋮ Implementing gradient descent decoding ⋮ Analysis of Termatiko sets in measurement matrices

This page was built for publication: Pseudocodewords of Tanner Graphs