Demo Data from VLDB 2026 / reviewers in the wild / expert
Mathieu Bogaerts
dblp:19/7589
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2010
—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 |
Combinatorics and discrete mathematics · 56% Coding theory · 44% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Combinatorics and discrete mathematics
enumeration |
0.1 | 1 | 2010 | Isometries and construction of permutation arrays · IEEE Trans. Inf. Theory 2010 |
Coding theory › error-correcting codes › combinatorial coding theory
permutation codes |
0.1 | 1 | 2010 | Isometries and construction of permutation arrays · IEEE Trans. Inf. Theory 2010 |
Methods — techniques the papers use, named apart from their topics
rejection algorithm · 0.1invariant construction · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Isometries and construction of permutation arraysabstractAn(n,d)-permutation code is a subsetCofSym(n)such that the Hamming distanced_Hbetween any two distinct elements ofCis at least equal tod. In this paper, we use the characterization of the isometry group of the metric space(Sym(n),d_H)in order to develop generating algorithms with rejection of isomorphic objects. To classify the(n,d)-permutation codes up to isometry, we construct invariants and study their efficiency. We give the numbers of nonisometric(4, 3)- and(5, 4)- permutation codes. Maximal and balanced(n,d)-permutation codes are enumerated in a constructive way. Mathieu Bogaerts |
IEEE Trans. Inf. Theory | 1 |