✦ LIBER ✦

Bounds on the redundancy of binary alphabetical codes

✍ Scribed by Nakatsu, N.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some Upper Bounds on the Redundancy of O

✍ Khosravifard, M.; Kheradmand, S. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 410 KB

New bounds on the redundancy of Huffman

✍ Capocelli, R.M.; De Santis, A. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 727 KB

Tight bounds on the redundancy of Huffma

✍ Manstetten, D. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 713 KB

Bounds on the redundancy of Huffman code

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

On the redundancy of binary Huffman code

✍ Johnsen, O. 📂 Article 📅 1980 🏛 IEEE 🌐 English ⚖ 410 KB

Tight upper bounds on the redundancy of

✍ Capocelli, R.M.; De Santis, A. 📂 Article 📅 1989 🏛 IEEE 🌐 English ⚖ 770 KB