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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

If we consider the neural network optimization process as a model selection problem, the implicit space can be constrained by the…

2012

Global financial crises like the one recently experienced affect both large and small institutions. Today, when there is…

2009

There has been considerable research in studying collaborative designing using protocol analysis. However, it is not possible to…

2002

We offer two noiseless codes for blocks of integers X/sup n/ = (X/sub 1/, ..., X/sub n/). We provide explicit bounds on the…

2001

— We suggest an algorithm for the calculation of the optimal universal code for a source which generates letters with unknown…

2000

Given a square image with number of rows and columns a power of two, we obtain an image sequence by continued downsampling by a…

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

The following problem in universal source coding is explored. Some members of a class of sources have various constraints on the…

1980

For a class of ergodic sources \Lambda on a given finite alphabet satisfying certain conditions, a formula is given for the…

1978

The existence of a fixed-rate block source code whose performance for each source in a class of Markov sources is uniformly close…