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

Donald J. Newman

dblp:14/209 · 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%
Computer graphics and multimedia
1 paper
Image and video coding · 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
The hexagon theorem · IEEE Trans. Inf. Theory 1982
Coding theory › source coding › quantization
quantizer design
0.011982
The hexagon theorem · IEEE Trans. Inf. Theory 1982
Coding theory
source coding
0.011982
The hexagon theorem · IEEE Trans. Inf. Theory 1982
Image and video coding
pulse-code modulation
0.011982
The hexagon theorem · IEEE Trans. Inf. Theory 1982
YearPublicationVenuePosition
1982 The hexagon theorem
abstract
We wish to\int_{S}|Z-f(Z)|^{2},Sthe unit square, over all choices off(Z)which take just n values. For large n it is shown thatf(Z)approaches that function which on each face of a "hexagonal mesh" has the value of the centroid of that face. This problem in the design of quantizers for a pulse-code modulation (PCM) system arose in which pairs of adjacent samples are quantized in an effort to capitalize on the correlation between samples and on the geometry of the plane.
Donald J. Newman
IEEE Trans. Inf. Theory1