Demo Data from EDBT 2026 / reviewers in the wild / expert
Martin Janosov
dblp:31/2032
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2008
—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 › block codes › linear code
binary linear codes |
0.1 | 1 | 2008 | New [47, 15, 16] Linear Binary Block Code · IEEE Trans. Inf. Theory 2008 |
Coding theory
error-correcting codes |
0.1 | 1 | 2008 | New [47, 15, 16] Linear Binary Block Code · IEEE Trans. Inf. Theory 2008 |
Coding theory › error-correcting codes › block codes
linear block codes |
0.1 | 1 | 2008 | New [47, 15, 16] Linear Binary Block Code · IEEE Trans. Inf. Theory 2008 |
Coding theory › error-correcting codes › coding bounds
minimum distance bounds |
0.1 | 1 | 2008 | New [47, 15, 16] Linear Binary Block Code · IEEE Trans. Inf. Theory 2008 |
Methods — techniques the papers use, named apart from their topics
weight spectrum analysis · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | New [47, 15, 16] Linear Binary Block CodeabstractA new$[47,15,16]$linear binary block code and its weight spectrum is presented. The code is better than the previously known$[47,15,15]$code and it reaches the upper bound on code distance for the codeword length$47$and dimension$15$. Martin Janosov, Martin Husák, Peter Farkas, Ana García Armada |
IEEE Trans. Inf. Theory | 1 |