Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

William G. Bath

dblp:17/5257 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1982
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › source coding
quantization
0.011982
Robust memoryless quantization for minimum signal distortion · IEEE Trans. Inf. Theory 1982
Coding theory › source coding › quantization
robust quantization
0.011982
Robust memoryless quantization for minimum signal distortion · IEEE Trans. Inf. Theory 1982
Coding theory › source coding
lossy source coding
0.011982
Robust memoryless quantization for minimum signal distortion · IEEE Trans. Inf. Theory 1982
Coding theory
source coding
0.011982
Robust memoryless quantization for minimum signal distortion · IEEE Trans. Inf. Theory 1982

Methods — techniques the papers use, named apart from their topics

unimodal distributions · 0.0moment constraints · 0.0minimax optimization · 0.0
YearPublicationVenuePosition
1982 Robust memoryless quantization for minimum signal distortion
abstract
Robust quantizers are designed for situations where there is only an incomplete statistical description of the quantizer input. The goal of the design is to closely approximate quantizer inputs by quantizer outputs without using more than a specified number of quantization levels. The exact probability distribution of the input is unknown, but this distribution is known to belong to some setC. The primary, setCconsidered is the set of all unimodal probability distributions which satisfy generalized moment constraint (e.g., mean-square value less than or equal to a constant). A quantizer is derived which minimizes over all quantizers the maximum distortion over all distributions inC. This robust quantizer guarantees a significanfiy lower worst case distortion than the classical Gaussian-optimal quantizer, while performing nearly as well as the Gaussian-optimal quantizer when the input is, in fact, Gaussian.
William G. Bath, V. David VandeLinde
IEEE Trans. Inf. Theory1