✦ LIBER ✦

Optimum `1'-ended binary prefix codes

✍ Scribed by Berger, T.; Yeung, R.W.

Book ID: 114540687
Publisher: IEEE
Year: 1990
Tongue: English
Weight: 566 KB
Volume: 36
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.59940

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Binary prefix codes ending in a “1”

✍ Capocelli, R.M.; De Santis, A.; Persiano, G. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 717 KB

A dynamic programming algorithm for cons

A dynamic programming algorithm for constructing optimal “1”-ended binary prefix-free codes

✍ Sze-Lok Chan; Golin, M.J. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 300 KB

Optimal binary one-ended codes

✍ Kukorelly, Z. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 359 KB

Extended synchronizing codewords for bin

Extended synchronizing codewords for binary prefix codes

✍ Wai-Man Lam; Kulkarni, S.R. 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 495 KB

Optimal binary prefix-condition codes wi

Optimal binary prefix-condition codes with ordinal probabilities

✍ Greenberg, Irwin 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 432 KB

Probability estimates for letters in a finite alphabet are derived in order to apply the Huffman algorithm to determine an optimal binary prefix-condition code. The estimates maximize the entropy subject to constraints specifying second-level orderings of the letters' iikeiihoods. These are compared

Almost all complete binary prefix codes

Almost all complete binary prefix codes have a self-synchronizing string

✍ Freiling, C.F.; Jungreis, D.S.; Theberge, F.; Zeger, K. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 378 KB