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.

M. L. Sethia

dblp:09/482 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1983
—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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › source coding › predictive coding
differential pulse-code modulation
0.011983
Low-rate tree coding of autoregressive sources · IEEE Trans. Inf. Theory 1983
Coding theory
source coding
0.011983
Low-rate tree coding of autoregressive sources · IEEE Trans. Inf. Theory 1983
Coding theory › source coding
tree coding
0.011983
Low-rate tree coding of autoregressive sources · IEEE Trans. Inf. Theory 1983
Coding theory › source coding › rate-distortion theory
autoregressive source
0.011983
Low-rate tree coding of autoregressive sources · IEEE Trans. Inf. Theory 1983
Coding theory › source coding
rate-distortion theory
0.011983
Low-rate tree coding of autoregressive sources · IEEE Trans. Inf. Theory 1983

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

random coding · 0.0
YearPublicationVenuePosition
1983 Low-rate tree coding of autoregressive sources
abstract
The performance of differential pulse-code modulation and random codes is evaluated experimentally for a range of autoregressive sources, including Gaussian and Laplacian sources of orders1, 2, and3encoded at rates1, 2, and7. Correlations are typical of those encountered in speech and images. Results show that the gain from a fixed moderate degree of code searching increases as the rate decreases, and increases consistently with1 /D_{o}, whereD_{o}is the Berger-Gray critical distortion. Laplacian and Gaussian sources behave similarly. Random codes perform better than DPCM codes for lightly correlated Laplacian sources but are otherwise worse.
M. L. Sethia, John B. Anderson
IEEE Trans. Inf. Theory1