✦ LIBER ✦

Tight lower bounds for optimum code length (Corresp.)

✍ Scribed by Rissanen, J.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The random coding bound is tight for the

✍ Gallager, R. 📂 Article 📅 1973 🏛 IEEE 🌐 English ⚖ 467 KB

Constructing codes with bounded codeword

✍ van Voorhis, D. 📂 Article 📅 1974 🏛 IEEE 🌐 English ⚖ 505 KB

A bound for arithmetic codes of composit

✍ Hartmann, C.; Tzeng, K. 📂 Article 📅 1972 🏛 IEEE 🌐 English ⚖ 134 KB

A bound for cyclic codes of composite le

✍ Hartmann, C.; Tzeng, K. 📂 Article 📅 1972 🏛 IEEE 🌐 English ⚖ 118 KB

Tight lower bounds for Shellsort

✍ Mark Allen Weiss; Robert Sedgewick 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Tight lower bounds on the length of word

✍ Ingo Althöfer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 113 KB