Tales of Huffman
Paul M. B. Vitanyi, Zvi Lotker
Abstract
We study the new problem of Huffman-like codes subject to individual restrictions on the code-word lengths of a subset of the source words. These are prefix codes with minimal expected code-word length for a random source where additionally the code-word lengths of a subset of the source words is prescribed, possibly differently for every such source word. Based on a structural analysis of properties of optimal solutions, we construct an efficient dynamic programming algorithm for this problem, and for an integer programming problem that may be of independent interest.
Create a lesson
Related papers
Deterministic Identification over Additive Gaussian Channels
Jonathan E. W. Huffmann, Holger Boche
Knowledge Distillation Driven Semantic NOMA with GAN Refinement for 6G Robotic Vehicle Networks
Qifei Wang, Zhen Gao, Li Qiao et al.
Real-Time Reconstruction of Markov Sources over MPR Channels
Pansee S. Elessawy, Nikolaos Pappas
Minimum Rate For Partially Observable Linear System with Side Information: LQG Plant and Gaussian-Markov Source
Sijie Li, Hyeji Kim
Spectral Approximation and Ergodic-Capacity Convergence of HMIMO Channels under Spatial-Wavenumber Domain Mismatch
Hangsong Yan, Hong Yang, Shu Sun
Sharp Minimax Regret for Infinite-Memory Logistic Prediction
Vaneet Aggarwal