A bivariate asymptotic expansion of coefficients of powers of generating functions
European Journal of Combinatorics
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Singularity analysis and asymptotics of Bernoulli sums
Theoretical Computer Science
Average Case Analysis of Algorithms on Sequences
Average Case Analysis of Algorithms on Sequences
Precise Average Redundancy Of An Idealized Arithmetic Coding
DCC '02 Proceedings of the Data Compression Conference
New bounds on the expected length of one-to-one codes
IEEE Transactions on Information Theory
Entropy computations via analytic depoissonization
IEEE Transactions on Information Theory
Asymptotic average redundancy of Huffman (and other) block codes
IEEE Transactions on Information Theory
Precise minimax redundancy and regret
IEEE Transactions on Information Theory
New Bounds on the Expected Length of Optimal One-to-One Codes
IEEE Transactions on Information Theory
A One-to-One Code and Its Anti-Redundancy
IEEE Transactions on Information Theory
| Hi-index | 0.01 |
Conventional wisdom states that the minimum expected length for fixed-to-variable length encoding of an n-block memoryless source with entropy H grows as nH+O(1). However, this performance is obtained under the constraint that the code assigned to the whole n-block is a prefix code. Dropping this unnecessary constraint we show that the minimum expected length grows as nH - 1/2log n+O(1) unless the source is equiprobable.