✦ LIBER ✦

Bounds on the bit rate of linear runlength codes (Corresp.)

✍ Scribed by Huang, T.

Book ID: 114634407
Publisher: IEEE
Year: 1975
Tongue: English
Weight: 271 KB
Volume: 21
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.1975.1055446

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New bounds on binary linear codes of dim

New bounds on binary linear codes of dimension eight (Corresp.)

✍ Dodunekov, S.; Helleseth, T.; Manev, N.; Ytrehus, O. 📂 Article 📅 1987 🏛 IEEE 🌐 English ⚖ 431 KB

On the minimum bit-error rate of linear

On the minimum bit-error rate of linear codes

✍ Khayrallah, A.S. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 733 KB

Bounds on the redundancy of Huffman code

Bounds on the redundancy of Huffman codes (Corresp.)

✍ Capocelli, R.; Giancarlo, R.; Taneja, I. 📂 Article 📅 1986 🏛 IEEE 🌐 English ⚖ 547 KB

Upper bounds on the size of error-correc

Upper bounds on the size of error-correcting runlength-limited codes

✍ Winick, Kim A. ;Yang, Shih-Hsuan 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 757 KB

The maximum achievable rate of an error-correcting runlength-limited code is consid-ered. Runlength-limited codes find wide appIications in magnetic and optical recording, baseband. pulse transmission, and fiber optic communications. When a runlength-limited code is used on a noisy channel, error-co

Bounds on the probability of error for c

Bounds on the probability of error for convolutional codes (Corresp.)

✍ Chin-Long Chen; Rutledge, R. 📂 Article 📅 1976 🏛 IEEE 🌐 English ⚖ 402 KB

On the complete decoding of binary linea

On the complete decoding of binary linear codes (Corresp.)

✍ Elia, M.; Prati, G. 📂 Article 📅 1985 🏛 IEEE 🌐 English ⚖ 459 KB