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. Michelson

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
block codes		 0.011977
On the computation of the probability of post-decoding error events for block codes (Corresp.) · IEEE Trans. Inf. Theory 1977
Coding theory › error-correcting codes › decoding › minimum distance decoding
bounded-distance decoding		 0.011977
On the computation of the probability of post-decoding error events for block codes (Corresp.) · IEEE Trans. Inf. Theory 1977
Coding theory › error-correcting codes › decoding
errors-and-erasures decoding		 0.011977
On the computation of the probability of post-decoding error events for block codes (Corresp.) · IEEE Trans. Inf. Theory 1977

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

weight distribution · 0.0
YearPublicationVenuePosition
1977 On the computation of the probability of post-decoding error events for block codes (Corresp.)
abstract
The computation of the probability of certain post-decoding error events is formulated for block codes whose weight distributions are known. A bounded-distance decoder for group codes is assumed. Numerical examples included show post-decoding character error rates for the Golay code and for some Reed-Solomon codes and the distribution of post-decoding errors for the same Reed-Solomon codes. An extension to errors and erasures decoding is also given.
Z. M. Huntoon, A. Michelson
 IEEE Trans. Inf. Theory2