
The paper treats data compression from the viewpoint of probability theory where a certain error probability is tolerable. We obtain bounds for the minimal rate given an error probability for blockcoding of general stationary ergodic sources. An application of the theory of large deviations provides numerical methods to compute for memoryless sources, the minimal compression rate given a tolerable error probability. Interesting connections between Cramer's functions and Shannon's theory for lossy coding are found.
Shannon's theory, Cramer's functions, Source coding, Error probability in coding theory, Rate-distortion theory in information and communication theory, large deviations, Large deviations, compression rate, Coding theorems (Shannon theory), bounds, error probability, data compression
Shannon's theory, Cramer's functions, Source coding, Error probability in coding theory, Rate-distortion theory in information and communication theory, large deviations, Large deviations, compression rate, Coding theorems (Shannon theory), bounds, error probability, data compression
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
