✦ LIBER ✦

New bounds on the expected length of one-to-one codes

✍ Scribed by Blundo, C.; De Prisco, R.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Bounds on the Expected Length of Opt

✍ Jay Cheng; Tien-Ke Huang; Weidmann, C. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 534 KB

A lower bound on the expected length of

✍ Alon, N.; Orlitsky, A. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 273 KB

Several new lower bounds on the size of

✍ Blass, U.; Litsyn, S. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 225 KB

A New Lower Bound on the Minimal Length

✍ M.C. Bhandari; M.S. Garg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 256 KB

Binary and ternary codes of covering rad

✍ Wolfgang Haas 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 128 KB

New bounds on the redundancy of Huffman

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