Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes
From MaRDI portal
Publication:3604480
DOI10.1109/TIT.2007.911177zbMath1304.94123MaRDI QIDQ3604480
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
fundamental conepseudocodewordslow-density parity-check (LDPC) codeslinear programming (LP) decodingpseudoweight stopping sets
Related Items (2)
Two classes of LDPC codes from the space of Hermitian matrices over finite fields ⋮ Pseudocodeword-free criterion for codes with cycle-free Tanner graph
This page was built for publication: Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes