Huffman coding
A Moffat - ACM Computing Surveys (CSUR), 2019 - dl.acm.org
Huffman's algorithm for computing minimum-redundancy prefix-free codes has almost
legendary status in the computing disciplines. Its elegant blend of simplicity and applicability …
legendary status in the computing disciplines. Its elegant blend of simplicity and applicability …
Region-based fractal image compression using heuristic search
L Thomas, F Deravi - IEEE transactions on Image processing, 1995 - ieeexplore.ieee.org
Presents work carried out on fractal (or attractor) image compression. The approach relies
on the assumption that image redundancy can be efficiently exploited through self …
on the assumption that image redundancy can be efficiently exploited through self …
Binary prefix codes ending in a" 1"
RM Capocelli, A De Santis… - IEEE Transactions on …, 1994 - ieeexplore.ieee.org
Binary prefix codes with the constraint that each codeword must end with a" 1" have been
recently introduced by Berger and Yeung (1990). We analyze the performance of such …
recently introduced by Berger and Yeung (1990). We analyze the performance of such …
Variations on a theme by Gallager
RM Capocelli, A De Santis - Image and Text Compression, 1992 - Springer
Variations on a Theme by Gallager* Page 1 8 Variations on a Theme by Gallager* Renato M.
Capo celli Department of Computer Science Universita di Roma "La Sapienza" 00185 Roma …
Capo celli Department of Computer Science Universita di Roma "La Sapienza" 00185 Roma …
An examination of the sub-optimality of the state-sorting algorithm in tabled asymmetric numeral systems
S Rezaei - 2024 - corpus.ulaval.ca
Résumé La croissance rapide des données dans différentes applications telles que la
communication en temps réel, les systèmes automobiles et la visioconférence a souligné la …
communication en temps réel, les systèmes automobiles et la visioconférence a souligné la …