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

David C. Larson

dblp:88/4100 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1988
—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 · 77% Information theory · 23%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › error probability analysis
error event analysis		 0.011988
On the minimum length error event of minimum Euclidean weight · IEEE Trans. Inf. Theory 1988
Information theory › hypothesis testing
maximum likelihood detection		 0.011988
On the minimum length error event of minimum Euclidean weight · IEEE Trans. Inf. Theory 1988
YearPublicationVenuePosition
1988 On the minimum length error event of minimum Euclidean weight
abstract
Let eta denote the length of the shortest error event achieving the minimum detection distance of maximum-likelihood signal detection for an impulse response having memory v. A family of impulse responses where eta is of order v/sup 2/ is exhibited. This, in turn, shows that some difficulty can arise in computing the minimum detection distance.>
David C. Larson, Jonathan J. Ashley, Thomas D. Howell
 IEEE Trans. Inf. Theory1