✦ LIBER ✦

Bounds on the redundancy of Huffman codes (Corresp.)

✍ Scribed by Capocelli, R.; Giancarlo, R.; Taneja, I.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the redundancy of -ary

✍ Golic, J.; Obradovic, M. 📂 Article 📅 1987 🏛 IEEE 🌐 English ⚖ 339 KB

On the redundancy of binary Huffman code

✍ Johnsen, O. 📂 Article 📅 1980 🏛 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

Tight upper bounds on the redundancy of

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

Redundancy-Related Bounds for Generalize

✍ Baer, M.B. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 316 KB