Demo Data from SIGIR 2026 / reviewers in the wild / expert
Hiroshi Fujiya
dblp:77/73
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1981
—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
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › decoding › minimum distance decoding
bounded-distance decoding |
0.0 | 1 | 1981 | Generalized tensor product codes · IEEE Trans. Inf. Theory 1981 |
Coding theory
error-correcting codes |
0.0 | 1 | 1981 | Generalized tensor product codes · IEEE Trans. Inf. Theory 1981 |
Coding theory › error-correcting codes › code construction
tensor product codes |
0.0 | 1 | 1981 | Generalized tensor product codes · IEEE Trans. Inf. Theory 1981 |
Methods — techniques the papers use, named apart from their topics
decoding algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1981 | Generalized tensor product codesabstractA class of binary error-correcting codes, called generalized tensor product codes, is presented with their decoding algorithm. These codes are constructed by combining a number of codes on various extension fields with shorter binary codes. A general algorithm is provided to do bounded distance decoding for these codes. Simply decodable codes such as Wolf's tensor product codes are shown to be special cases of this class of codes. Simply decodable and more efficient codes than Wolf's codes are also included as special cases. Hideki Imai, Hiroshi Fujiya |
IEEE Trans. Inf. Theory | 2 |