✦ LIBER ✦

On the minimum pseudo-codewords of LDPC codes

✍ Scribed by Shu-Tao Xia; Fang-Wei Fu

Book ID: 117886244
Publisher: IEEE
Year: 2006
Tongue: English
Weight: 145 KB
Volume: 10
Category: Article
ISSN: 1089-7798
DOI: 10.1109/lcomm.2006.1633324

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Number of Minimum Stopping Sets a

On the Number of Minimum Stopping Sets and Minimum Codewords of Array LDPC Codes

✍ Haiyang Liu; Lianrong Ma; Jie Chen 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 161 KB

On minimum weight codewords in QR codes

✍ Donald W Newhart 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 927 KB

On the minimum distance of array codes a

On the minimum distance of array codes as LDPC codes

✍ Kyeongcheol Yang; Helleseth, T. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 249 KB

Minimum Pseudoweight and Minimum Pseudoc

Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes

✍ Shu-Tao Xia; Fang-Wei Fu 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 270 KB

Computing the Minimum Distance of Nonbin

Computing the Minimum Distance of Nonbinary LDPC Codes

✍ Lei Liu; Jie Huang; Wuyang Zhou; Shengli Zhou 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 161 KB

Small weight codewords in the LDPC codes

Small weight codewords in the LDPC codes arising from linear representations of geometries

✍ V. Pepe; L. Storme; G. Van de Voorde 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

## Abstract In this article, we investigate the minimum distance and small weight codewords of the LDPC codes of linear representations, using only geometrical methods. First, we present a new lower bound on the minimum distance and we present a number of cases in which this lower bound is sharp. T