✦ LIBER ✦

Alphabetic codes revisited

✍ Scribed by Yeung, R.W.

Book ID: 114541448
Publisher: IEEE
Year: 1991
Tongue: English
Weight: 730 KB
Volume: 37
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.79913

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Optimal Alphabetic Tree Problem Revi

The Optimal Alphabetic Tree Problem Revisited

✍ Lawrence L Larmore; Teresa M Przytycka 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 202 KB

The Optimal Alphabetic Binary Tree OABT problem is equivalent to the Optimal Binary Search Tree problem where the weights are associated only with Ž . the leaves. The problem can be solved in O n log n time, while the best known Ž . lower bound is ⍀ n . In this paper we relate the complexity of the

Fire codes revisited

✍ Henk C.A. van Tilborg 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 223 KB

In traditional discussions of Fire codes, the proof of the burst-correction capability of this code is rather technical. It is never left out, because the descriptions of the standard decoding algorithm (by means of shift registers) do not give an independent proof of this burst-correction capabili

Polyadic codes revisited

✍ San Ling; Chaoping Xing 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 378 KB

Coding on Countably Infinite Alphabets

✍ Boucheron, S.; Garivier, A.; Gassiat, E. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 363 KB

Alphabet Partitioning Techniques for Sem

Alphabet Partitioning Techniques for Semiadaptive Huffman Coding of Large Alphabets

📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 31 KB

Alphabet Partitioning Techniques for Sem

Alphabet Partitioning Techniques for Semiadaptive Huffman Coding of Large Alphabets

✍ Chen, D.; Yi-Jen Chiang; Memon, N.; Xiaolin Wu 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 604 KB