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

M. Taguchi

dblp:83/4678 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1997
—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 · 50% Computational complexity · 50%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › decoding › channel decoding
erasure decoding		 0.011997
Performance of explicit error detection and threshold decision in decoding with erasures · IEEE Trans. Inf. Theory 1997
Computational complexity › boolean function complexity
threshold problem		 0.011997
Performance of explicit error detection and threshold decision in decoding with erasures · IEEE Trans. Inf. Theory 1997
YearPublicationVenuePosition
1997 Performance of explicit error detection and threshold decision in decoding with erasures
abstract
We study the performance of two schemes for decoding with erasures: threshold decision and decision by explicit error detection. We show that the latter scheme based on error-detection coding and maximum-likelihood decoding is at least as good as the former scheme, at least for binary symmetric channels.
Takeshi Hashimoto, M. Taguchi
 IEEE Trans. Inf. Theory2