Journal ArticleDOI
Generalization of Huffman coding to minimize the probability of buffer overflow (Corresp.)
Reads0
Chats0
TLDR
An algorithm is given to find a prefix condition code that minimizes the value of the moment generating function of the codeword length distribution for a given positive argument.Abstract:
An algorithm is given to find a prefix condition code that minimizes the value of the moment generating function of the codeword length distribution for a given positive argument. This algorithm is used in an iterative way to yield a code that maximizes the rate of decay of the probability of buffer overflow as the buffer length increases.read more
Citations
More filters
Book
Geometric Programming for Communication Systems
TL;DR: This text provides both an in-depth tutorial on the theory, algorithms, and modeling methods of GP, and a comprehensive survey on the applications of GP to the study of communication systems.
Journal ArticleDOI
Guessing subject to distortion
Erdal Arikan,Neri Merhav +1 more
TL;DR: This work investigates the problem of guessing a random vector X within distortion level D and proposes an asymptotically optimal guessing scheme that is universal both with respect to the information source and the value of /spl rho/.
Book
Statistical Physics and Information Theory
TL;DR: This chapter discusses the Random Energy Model and Random Coding, as well as analysis tools and Asymptotic Methods, and the physical interpretation of information measures.
Journal ArticleDOI
Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics
TL;DR: The source dispersion and the source varentropy rate serves to tightly approximate the fundamental nonasymptotic limits of fixed-to-variable compression for all but very small block lengths.
References
More filters
Book
Information Theory and Reliable Communication
TL;DR: This chapter discusses Coding for Discrete Sources, Techniques for Coding and Decoding, and Source Coding with a Fidelity Criterion.
Journal ArticleDOI
A Method for the Construction of Minimum-Redundancy Codes
TL;DR: A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
Journal ArticleDOI
A method for the construction of minimum-redundancy codes
TL;DR: A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
Journal ArticleDOI
Buffer overflow in variable length coding of fixed rate sources
TL;DR: This paper develops and analyzes an easily instrumentable scheme for variable length encoding of discrete memoryless fixed-rate sources in which buffer overflows result in codeword erasures at locations that are perfectly specified to the user, and shows that no loss of synchronism ever occurs.