Demo Data from VLDB 2026 / reviewers in the wild / expert
G. B. Horn
dblp:37/3313
· 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 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
block codes |
0.0 | 1 | 1996 | On the intractability of permuting a block code to minimize trellis complexity · IEEE Trans. Inf. Theory 1996 |
Coding theory › error-correcting codes › convolutional codes
trellis complexity |
0.0 | 1 | 1996 | On the intractability of permuting a block code to minimize trellis complexity · IEEE Trans. Inf. Theory 1996 |
Coding theory › trellis codes
trellis complexity minimization |
0.0 | 1 | 1996 | On the intractability of permuting a block code to minimize trellis complexity · IEEE Trans. Inf. Theory 1996 |
Methods — techniques the papers use, named apart from their topics
NP-completeness reduction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1996 | On the intractability of permuting a block code to minimize trellis complexityabstractAn important problem in the theory and application of block code trellises is to find a coordinate permutation of a given code to minimize the trellis complexity. We show that the problem of finding a coordinate permutation that minimizes the number of vertices at a given depth in the minimal trellis for a binary linear block code is NP-complete. G. B. Horn, Frank R. Kschischang |
IEEE Trans. Inf. Theory | 1 |