✦ LIBER ✦

An improved Ziv-lempel coding scheme for universal source coding

✍ Scribed by Hidetoshi Yokoo

Book ID: 112075486
Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 618 KB
Volume: 69
Category: Article
ISSN: 8756-6621
DOI: 10.1002/ecja.4410691202

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Universal Scheme for Wyner–Ziv Coding

A Universal Scheme for Wyner–Ziv Coding of Discrete Sources

✍ Jalali, S.; Verdu, S.; Weissman, T. 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 749 KB

A new universal coding scheme for the bi

A new universal coding scheme for the binary memoryless source

✍ Lawrence, J. 📂 Article 📅 1977 🏛 IEEE 🌐 English ⚖ 984 KB

An improved outer bound for multitermina

An improved outer bound for multiterminal source coding

✍ Wagner, A.B.; Anantharam, V. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 468 KB

There is no universal source code for an

There is no universal source code for an infinite source alphabet

✍ Gyorfi, L.; Pali, I.; Van der Meulen, E.C. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 437 KB

An efficient memory allocation scheme fo

An efficient memory allocation scheme for Huffman coding of multiple sources

✍ Seung Jun Lee; Kyeong Ho Yang; Jun Seok Song; Choong Woong Lee 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 206 KB

In this paper, we propose an efficient memory allocation scheme for memory-constrained Huffman coding of multiple sources, which can be applied to many adaptive variable-length coding systems. The allocation of a given memory is performed in two stages. At the first stage, the iterative bisection al

An easily implementable universal code f

An easily implementable universal code for the binary source (Corresp.)

✍ Mackenthun, K., Jr. 📂 Article 📅 1982 🏛 IEEE 🌐 English ⚖ 473 KB