Variable-rate universal block source coding subject to a fidelity constraint

Mackenthun, Kenneth M.; Pursley, M.B.

doi:10.1109/tit.1978.1055880

Cited by 22 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The existence of blockcodes subject to a fidelity criterion has been proved under various assumptions on the class of sources, the fidelity criterion, and the type of convergence of the rates to the rate distortion function R(D). The problem was studied by Ziv [28], Mackenthun and Pursley [20], Omstein and Shields [24], and others.…”

Section: Introductionmentioning

confidence: 99%

Bounds on Data Compression Ratio with a Given Tolerable Error Probability

Sadeh¹

1998

Prob. Eng. Inf. Sci.

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%

Bounds on Data Compression Ratio with a Given Tolerable Error Probability

Sadeh¹

1998

Prob. Eng. Inf. Sci.

View full text Add to dashboard Cite

show abstract

“…A sequence of variable-rate codes of increasing block lengths which is asymptotically optimum as measured by redundancy is said to be universal for the given class of sources. Several previous papers have dealt with the existence of such sequences of codes (e.g., [1], [3], [6], and [9]). However, these are primarily asymptotic results which do not give an indication of the block length required to achieve a given redundancy or how to actually obtain a code which will achieve a given redundancy.…”

Section: Introductionmentioning

confidence: 99%

“…For convenience we also define an unnormalized redundancy 0l ~ by (5b) A sequence (In)= / 1 , / 2 , / 3 , • • • of variable-length source codes is weakly minimax universal [I] or weakly universal [6] for the class A if…”

mentioning

confidence: 99%

See 1 more Smart Citation

Efficient universal noiseless source codes

Davisson

McEliece

Pursley

et al. 1981

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

Abstract-Although the existence of universal noiseless variable-rate codes for the class of discrete stationary ergodic sources has previously been established, very few practical universal encoding methods are available. Efficient implementable universal source coding techniques are discussed in this paper. Results are presented on source codes for which a small value of the maximum redundancy is achieved with a relatively short block length. A constructive proof of the existence of universal noiseless codes for discrete stationary sources is first presented. The proof is shown to provide a method for obtaining efficient universal noiseless variable-rate codes for various classes of sources. For memoryless sources, upper and lower bounds are obtained for the minimax redundancy as a function of the block length of the code. Several techniques for constructing universal noiseless source codes for memoryless sources are presented and their redundancies are compared with the bounds. Consideration is given to possible applications to data compression for certain nonstationary sources.

show abstract

Rate‐Distortion Theory

Berger

2003

Wiley Encyclopedia of Telecommunications

373

220

View full text Add to dashboard Cite

Rate‐distortion theory is the branch of information theory that treats compressing the data produced by an information source down to a specified encoding rate that is strictly less than the source's entropy. This necessarily entails some lossiness, or distortion, between the original source data and the best approximation thereto that can be produced on the basis of the encoder's output bits. Rate‐distortion theory was introduced in the seminal works written in 1948 and 1959 by C. E. Shannon , the founder of information theory. We describe Shannon's contribution and then trace its subsequent development worldwide. Heavier than usual emphasis is placed on the concept of “matching” a channel to a source in the rate‐distortion sense, and also on the analogous matching of a source to a channel. Experimental evidence has been mounting in support of the hypothesis that living organisms often simultaneously achieve both of these matchings when processing their sensory inputs, thereby eliminating the need for the complex encoding and decoding operations that are needed in order to produce an information‐theoretically optimum system in the absence of such double matching.

show abstract

Variable-rate universal block source coding subject to a fidelity constraint

Cited by 22 publications

References 17 publications

Bounds on Data Compression Ratio with a Given Tolerable Error Probability

Bounds on Data Compression Ratio with a Given Tolerable Error Probability

Efficient universal noiseless source codes

Rate‐Distortion Theory

Contact Info

Product

Resources

About