Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,883,535 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Arithmetic coding
Block code
Comma code
Data compression
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Estimation of Probability of Defaults (PD) for Low-Default Portfolios: An Actuarial Approach
N. Iqbal
,
S. Ali
2012
Corpus ID: 15490403
Global financial crises like the one recently experienced affect both large and small institutions. Today, when there is…
Expand
2010
2010
Between philosophies : the emergence of a new intellectual paradigm in Russia
Alyssa DeBlasio
2010
Corpus ID: 140781642
This dissertation takes as its primary task the evaluation of a conflict of paradigms in Russian philosophical thought in the…
Expand
2009
2009
The Effect of Computer Mediation on Collaborative Designing
Jeff W. T. Kan
,
J. Gero
CAADRIA proceedings
2009
Corpus ID: 184481091
There has been considerable research in studying collaborative designing using protocol analysis. However, it is not possible to…
Expand
2004
2004
Universal coding of function spaces as a model signal compression
B. Ryabko
,
J. Astola
Data Compression Conference, . Proceedings. DCC
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…
Expand
2001
2001
Universal coding for sources with partially ordered probabilities
B. Ryabko
,
F. Topsøe
2001
Corpus ID: 12614591
— We suggest an algorithm for the calculation of the optimal universal code for a source which generates letters with unknown…
Expand
1993
1993
Exact analysis of the Lempel-Ziv algorithm for i.i.d. sources
T. Kawabata
IEEE Transactions on Information Theory
1993
Corpus ID: 29126169
A new analysis shows that, when we apply the Lempel-Ziv incremented parsing algorithm to i.i.d. source with probabilities:pi, i…
Expand
1982
1982
Strong universal source coding subject to a rate-distortion constraint
Roberto Garcia-Muñoz
,
D. Neuhoff
IEEE Transactions on Information Theory
1982
Corpus ID: 43391225
The following problem in universal source coding is explored. Some members of a class of sources have various constraints on the…
Expand
1980
1980
On the minimum rate for strong universal block coding of a class of ergodic sources
J. Kieffer
IEEE Transactions on Information Theory
1980
Corpus ID: 31510095
For a class of ergodic sources \Lambda on a given finite alphabet satisfying certain conditions, a formula is given for the…
Expand
1980
1980
Limit theorems for slowly varying composite sources
R. Fontana
IEEE Transactions on Information Theory
1980
Corpus ID: 31474978
Limit theorems are proved for the distortion-rate function and the entropy rate of a composite source in the limit of vanishingly…
Expand
1978
1978
Fixed-rate universal codes for Markov sources
D. Neuhoff
,
P. Shields
IEEE Transactions on Information Theory
1978
Corpus ID: 42469891
The existence of a fixed-rate block source code whose performance for each source in a class of Markov sources is uniformly close…
Expand