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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2001
Highly Cited
2001
We show that the normalized maximum-likelihood (NML) distribution as a universal code for a parametric class of models is closest… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We investigate a type of lossless source code called a grammar based code which in response to any input data string x over a xed… (More)
Is this relevant?
1998
1998
We introduce a notion of ‘relative redundancy’ for universal data compression and propose a universal code which asymptotically… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
3 Probability Coding 9 3.1 PrefixCodes. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.1.1… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The capacity of the channel induced by a given class of sources is well known to be an attainable lower bound on the redundancy… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Universal coding for the Slepian-Wolf data compression system is considered. We shall demonstrate based on a simple observation… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
A connection between universal codes and the problems of prediction and statistical estimation is established. A‘known lower… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
A/~~stract-For Slepian-Wolf source networks, the error exponents obtained by Kiirner, Marton, and the author are shown to be… (More)
Is this relevant?
Highly Cited
1977
Highly Cited
1977
A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a… (More)
Is this relevant?
Highly Cited
1973
Highly Cited
1973
A&ruct-Universal coding is any asymptotically opt imum method of block-to-block memoryless source coding for sources with unknown… (More)
Is this relevant?