✦ LIBER ✦

Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels

✍ Scribed by Pulkit Grover; Ajit Kumar Chaturvedi

Book ID: 114640573
Publisher: IEEE
Year: 2007
Tongue: English
Weight: 586 KB
Volume: 53
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2006.887511

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bounds on the rate of LDPC codes

✍ Burshtein, D.; Krivelevich, M.; Litsyn, S.; Miller, G. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 455 KB

Upper bounds on the rate of LDPC codes a

Upper bounds on the rate of LDPC codes as a function of minimum distance

✍ Ben-Haim, Y.; Litsyn, S. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 258 KB

Bounds on achievable rates of LDPC codes

Bounds on achievable rates of LDPC codes used over the binary erasure channel

✍ Barak, O.; Burshtein, D.; Feder, M. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 286 KB

Tighter Bounds on the Capacity of Finite

Tighter Bounds on the Capacity of Finite-State Channels Via Markov Set-Chains

✍ Jun Chen; Permuter, H.; Weissman, T. 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 672 KB

Upper Bounds for the Number of Conjugacy

Upper Bounds for the Number of Conjugacy Classes of a Finite Group

✍ Martin W. Liebeck; László Pyber 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 315 KB

For a finite group G, let k G denote the number of conjugacy classes of G. We prove that a simple group of Lie type of untwisted rank l over the field of q Ž . l elements has at most 6 q conjugacy classes. Using this estimate we show that for Ž . Ž . 10 n completely reducible subgroups G of GL n, q

Upper bounds on the free distance for a

Upper bounds on the free distance for a class of convolutional coded CPFSK signals

✍ Ertas, T. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 86 KB