✦ LIBER ✦

On the application of LDPC codes to arbitrary discrete-memoryless channels

✍ Scribed by Bennatan, A.; Burshtein, D.

Book ID: 114638238
Publisher: IEEE
Year: 2004
Tongue: English
Weight: 630 KB
Volume: 50
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2004.824917

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A construction of codes with exponential

A construction of codes with exponential error bounds on arbitrary discrete memoryless channels

✍ Uyematsu, T.; Okamoto, E. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 229 KB

Optimal detection of discrete Markov sou

Optimal detection of discrete Markov sources over discrete memoryless channels-applications to combined source-channel coding

✍ Phamdo, N.; Farvardin, N. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 837 KB

Applications of LDPC Codes to the Wireta

Applications of LDPC Codes to the Wiretap Channel

✍ Thangaraj, A.; Dihidar, S.; Calderbank, A.R.; McLaughlin, S.W.; Merolla, J-M. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 512 KB

On the converse to the coding theorem fo

On the converse to the coding theorem for discrete memoryless channels (Corresp.)

✍ Arimoto, S. 📂 Article 📅 1973 🏛 IEEE 🌐 English ⚖ 391 KB

An algorithm for computing the capacity

An algorithm for computing the capacity of arbitrary discrete memoryless channels

✍ Arimoto, S. 📂 Article 📅 1972 🏛 IEEE 🌐 English ⚖ 809 KB

On metrics matched to the discrete memor

On metrics matched to the discrete memoryless channel

✍ Gérald Séguin 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 604 KB

## A sequence of metrics {D,.,} is said to be additive and matched to a discrete memoryless channel (DMC) if DN is the sum on its coordinates of N single letter metrics and if the maximum likelihood decoder for sequences of length N is a minimum D,-distance decoder. Necessary and sufficient conditio