Demo Data from EDBT 2026 / reviewers in the wild / expert
P. Agabio
dblp:42/1283
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1996
—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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
concatenated codes |
0.0 | 1 | 1996 | Bounds on the weight hierarchy of generalized concatenated codes · IEEE Trans. Inf. Theory 1996 |
Coding theory › error-correcting codes › concatenated codes
generalized concatenated codes |
0.0 | 1 | 1996 | Bounds on the weight hierarchy of generalized concatenated codes · IEEE Trans. Inf. Theory 1996 |
Coding theory
generalized hamming weights |
0.0 | 1 | 1996 | Bounds on the weight hierarchy of generalized concatenated codes · IEEE Trans. Inf. Theory 1996 |
Coding theory › error-correcting codes › block codes › linear code › code parameters
weight hierarchy |
0.0 | 1 | 1996 | Bounds on the weight hierarchy of generalized concatenated codes · IEEE Trans. Inf. Theory 1996 |
Methods — techniques the papers use, named apart from their topics
bounds derivation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1996 | Bounds on the weight hierarchy of generalized concatenated codesabstractWe determine upper and lower bounds to the generalized Hamming weights of generalized concatenated codes. They are derived from the generalized Hamming weights of the outer codes and certain properties of the inner code and its partitions. P. Agabio, Ezio Biglieri |
IEEE Trans. Inf. Theory | 1 |