Demo Data from EDBT 2026 / reviewers in the wild / expert
Y. Madelung
dblp:24/3575
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1995
—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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
algebraic geometry code |
0.0 | 1 | 1995 | Fast decoding of algebraic-geometric codes up to the designed minimum distance · IEEE Trans. Inf. Theory 1995 |
Coding theory › error-correcting codes
decoding |
0.0 | 1 | 1995 | Fast decoding of algebraic-geometric codes up to the designed minimum distance · IEEE Trans. Inf. Theory 1995 |
Coding theory › error-correcting codes › algebraic geometry code
designed minimum distance |
0.0 | 1 | 1995 | Fast decoding of algebraic-geometric codes up to the designed minimum distance · IEEE Trans. Inf. Theory 1995 |
Coding theory › error-correcting codes › algebraic geometry code
hermitian codes |
0.0 | 1 | 1995 | Fast decoding of algebraic-geometric codes up to the designed minimum distance · IEEE Trans. Inf. Theory 1995 |
Methods — techniques the papers use, named apart from their topics
sakata algorithm · 0.0feng-rao majority scheme · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | Fast decoding of algebraic-geometric codes up to the designed minimum distanceabstractWe present a decoding algorithm for algebraic-geometric codes from regular plane curves, in particular the Hermitian curve, which corrects all error patterns of weight less than d*/2 with low complexity. The algorithm is based on the majority scheme of Feng and Rao (1993) and uses a modified version of Sakata's (1988) generalization of the Berlekamp-Massey algorithm. Shojiro Sakata, Jørn Justesen, Y. Madelung, Helge Elbrønd Jensen, Tom Høholdt |
IEEE Trans. Inf. Theory | 3 |