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
Demo Data from EDBT 2026 / reviewers in the wild / expert

A. Shohara

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

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

Theory of computation · 1

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 › error-correcting codes
block codes		 0.011973
On convergence of distortion for block and tree encoding of symmetric sources (Corresp.) · IEEE Trans. Inf. Theory 1973
Coding theory › source coding
rate-distortion theory		 0.011973
On convergence of distortion for block and tree encoding of symmetric sources (Corresp.) · IEEE Trans. Inf. Theory 1973
Coding theory › interactive communication
tree codes		 0.011973
On convergence of distortion for block and tree encoding of symmetric sources (Corresp.) · IEEE Trans. Inf. Theory 1973
Coding theory
source coding		 0.011973
On convergence of distortion for block and tree encoding of symmetric sources (Corresp.) · IEEE Trans. Inf. Theory 1973

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

difference equations · 0.0
YearPublicationVenuePosition
1973 On convergence of distortion for block and tree encoding of symmetric sources (Corresp.)
abstract
For symmetric sources we examine the rate of convergence to the rate-distortion function using block codes and tree codes. With block codes the average distortion decreases toward distortionDat a doubly exponential rate in block length for any fixed rate greater thanR(D), the rate-distortion function. For tree codes a difference equation for the probability distribution of the distortion is derived with tree depth as an independent variable. Its numerical solution suggests that the same doubly exponential convergence behavior applies to tree codes.
Jim K. Omura, A. Shohara
 IEEE Trans. Inf. Theory2