Minimum Expected Length of Fixed-to-Variable Lossless Compression Without Prefix Constraints

@article{Szpankowski2011MinimumEL,
  title={Minimum Expected Length of Fixed-to-Variable Lossless Compression Without Prefix Constraints},
  author={Wojciech Szpankowski and Sergio Verd{\'u}},
  journal={IEEE Transactions on Information Theory},
  year={2011},
  volume={57},
  pages={4017-4025}
}
The minimum expected length for fixed-to-variable length encoding of an n-block memoryless source with entropy H grows as nH + O(1), where the term O(1) lies between 0 and 1. However, this well-known performance is obtained under the implicit constraint that the code assigned to the whole n-block is a prefix code. Dropping the prefix constraint, which is rarely necessary at the block level, we show that the minimum expected length for a finite-alphabet memoryless source with known distribution… CONTINUE READING
Highly Cited
This paper has 54 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 32 extracted citations

One-to-one lossless codes in the variable input-length regime: Back to Kraft's inequality

2015 IEEE Information Theory Workshop (ITW) • 2015
View 7 Excerpts
Highly Influenced

Non-Asymptotic Bounds for Optimal Fixed-to-Variable Lossless Compression without Prefix Constraints

2018 IEEE International Symposium on Information Theory (ISIT) • 2018
View 1 Excerpt

55 Citations

01020'13'15'17'19
Citations per Year
Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 32 references

A One-to-One Code and Its Anti-Redundancy

IEEE Transactions on Information Theory • 2008
View 2 Excerpts

On One-to-One Codes for Memoryless Cost Channels

IEEE Transactions on Information Theory • 2008

New Bounds on the Expected Length of Optimal One-to-One Codes

IEEE Transactions on Information Theory • 2007
View 1 Excerpt

teaching it,” XXVIII Shannon Lecture

S. Verdú
Proc. 2007 IEEE Int. Symp. Information Theory, Nice, France, Jun. 28, 2007. • 2007
View 2 Excerpts

Precise minimax redundancy and regret

IEEE Transactions on Information Theory • 2004

Average Case Analysis of Algorithms in Sequences

W. Szpankowski
New York: Wiley, • 2000
View 2 Excerpts

Similar Papers

Loading similar papers…