Demo Data from SIGIR 2026 / reviewers in the wild / expert
B. Dorsch
dblp:134/6405
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1974
—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
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › block codes
binary block codes |
0.0 | 1 | 1974 | A decoding algorithm for binary block codes and J -ary output channels (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Coding theory › error-correcting codes
block codes |
0.0 | 1 | 1974 | A decoding algorithm for binary block codes and J -ary output channels (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Coding theory › error-correcting codes › decoding
decoding algorithms |
0.0 | 1 | 1974 | A decoding algorithm for binary block codes and J -ary output channels (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Coding theory › error-correcting codes › decoding › decoding algorithms › optimal decoding
maximum-likelihood decoding |
0.0 | 1 | 1974 | A decoding algorithm for binary block codes and J -ary output channels (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Coding theory
channel coding |
0.0 | 1 | 1974 | A decoding algorithm for binary block codes and J -ary output channels (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0search algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1974 | A decoding algorithm for binary block codes and J -ary output channels (Corresp.)abstractA search algorithm is described to decode long binary block codes of any rate for the memoryless binary inputJ-ary output channel. It can be used directly to perform maximum-likelihood decoding or in a constrained version that gives considerably fewer searches at a small sacrifice in performance. Simulation results are given for a rate-l/2 code of length 128 and minimum Hamming distance 22 on the quantized Gaussian channel. B. Dorsch |
IEEE Trans. Inf. Theory | 1 |