Demo Data from VLDB 2026 / reviewers in the wild / expert
Ricard Vilar
dblp:295/8481
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0003-0631-330XORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 since 2021
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 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › algebraic geometry code
generalized reed-solomon codes |
0.6 | 1 | 2022 | Determining When a Truncated Generalised Reed-Solomon Code Is Hermitian Self-Orthogonal · IEEE Trans. Inf. Theory 2022 |
Methods — techniques the papers use, named apart from their topics
polynomial characterization · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Determining When a Truncated Generalised Reed-Solomon Code Is Hermitian Self-OrthogonalabstractWe prove that there is a Hermitian self-orthogonal$k$-dimensional truncated generalised Reed-Solomon code of length$n \leqslant q^{2}$over${\mathbb F}_{q^{2}}$if and only if there is a polynomial$g \in {\mathbb F}_{q^{2}}$of degree at most$(q-k)q-1$such that$g+g^{q}$has$q^{2}-n$distinct zeros. This allows us to determine the smallest$n$for which there is a Hermitian self-orthogonal$k$-dimensional truncated generalised Reed-Solomon code of length$n$over${\mathbb F}_{q^{2}}$, verifying a conjecture of Grassl and Rötteler. We also provide examples of Hermitian self-orthogonal$k$-dimensional generalised Reed-Solomon codes of length$q^{2}+1$over${\mathbb F}_{q^{2}}$, for$k=q-1$and$q$an odd power of two. Simeon Ball, Ricard Vilar |
IEEE Trans. Inf. Theory | 2 |