✦ LIBER ✦

Variable-length-to-variable length source coding: a greedy step-by-step algorithm

✍ Scribed by Fabris, F.

Book ID: 114539625
Publisher: IEEE
Year: 1992
Tongue: English
Weight: 821 KB
Volume: 38
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.149517

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Study on Bezier Curve Variable Step-leng

Study on Bezier Curve Variable Step-length Algorithm

✍ Guorong Xiao; Xuemiao Xu 📂 Article 📅 2012 🏛 Elsevier 🌐 English ⚖ 178 KB

Asymptotics of greedy algorithms for var

Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources

✍ Tabus, I.; Rissanen, J. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 605 KB

Universal variable-to-fixed length sourc

Universal variable-to-fixed length source codes

✍ Visweswariah, K.; Kulkarni, S.R.; Verdu, S. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 362 KB

Variable-to-fixed length codes are bette

Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources

✍ Ziv, J. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 229 KB

Correction to "Variable-to fixed length

Correction to "Variable-to fixed length codes are better than fixed-to-variable length codes for Markov sources"

✍ Ziv, J. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 119 KB

Random walks with variable step length o

Random walks with variable step length on regular lattices

✍ G. Zumofen; A. Blumen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 295 KB

N2 stud} random walks on reguhr lattlces, where the probabthty oi sreps oi length r 1s piopo~lonal tti rm6. For the diamond and the three cubic lattxes \\e determme numenull) the average number of dlstmct snes S(n) vtstted m an tzstep walk. Applied to walks restncted to nearest-neghbor steps, our me