Skip to search formSkip to main contentSkip to account menu

Universal code (data compression)

Known as: Universal Code (DataCompression), Universal code 
In data compression, a universal code for integers is a prefix code that maps the positive integers onto binary codewords, with the additional… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Global financial crises like the one recently experienced affect both large and small institutions. Today, when there is… 
2010
2010
This dissertation takes as its primary task the evaluation of a conflict of paradigms in Russian philosophical thought in the… 
2009
2009
There has been considerable research in studying collaborative designing using protocol analysis. However, it is not possible to… 
2004
2004
  • B. RyabkoJ. Astola
  • 2004
  • Corpus ID: 14864117
This paper addresses the problem of signal compression, basing on the mathematical model, in which a set of all possible signals… 
2001
2001
— We suggest an algorithm for the calculation of the optimal universal code for a source which generates letters with unknown… 
1993
1993
A new analysis shows that, when we apply the Lempel-Ziv incremented parsing algorithm to i.i.d. source with probabilities:pi, i… 
1982
1982
The following problem in universal source coding is explored. Some members of a class of sources have various constraints on the… 
1980
1980
For a class of ergodic sources \Lambda on a given finite alphabet satisfying certain conditions, a formula is given for the… 
1980
1980
Limit theorems are proved for the distortion-rate function and the entropy rate of a composite source in the limit of vanishingly… 
1978
1978
The existence of a fixed-rate block source code whose performance for each source in a class of Markov sources is uniformly close…