Demo Data from VLDB 2026 / reviewers in the wild / expert
Lara Vicino
dblp:285/5760
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
0000-0002-7480-8681ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 since 2021Theory 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 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
algebraic geometry code |
0.8 | 1 | 2024 | Two-Point AG Codes From One of the Skabelund Maximal Curves · IEEE Trans. Inf. Theory 2024 |
Coding theory
minimum distance estimation |
0.8 | 1 | 2024 | Two-Point AG Codes From One of the Skabelund Maximal Curves · IEEE Trans. Inf. Theory 2024 |
Coding theory › error-correcting codes › algebraic geometry code
weierstrass semigroup |
0.2 | 1 | 2024 | Two-Point AG Codes From One of the Skabelund Maximal Curves · IEEE Trans. Inf. Theory 2024 |
Methods — techniques the papers use, named apart from their topics
weierstrass semigroup computation · 0.8generalized order bound · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Locally Recoverable Codes with availability from a family of fibered surfacesabstractAbstract We construct Locally Recoverable Codes (LRCs) with availability 2 from a family of fibered surfaces. To obtain the locality and availability properties, and to estimate the minimum distance of the codes, we combine techniques coming from the theory of one-variable function fields and from the theory of fibrations on surfaces. When the locality parameter is $$r=3$$ r = 3 , we obtain a sharp bound on the minimum distance of the codes. In that case, we give a geometric interpretation of our codes in terms of doubly elliptic surfaces. In particular, this provides the first instance of an error correcting code constructed using a (doubly elliptic) K3 surface. Cecília Salgado, Lara Vicino |
Des. Codes Cryptogr. | 2 |
| 2024 | Two-Point AG Codes From One of the Skabelund Maximal CurvesabstractIn this paper, we investigate two-point Algebraic Geometry codes associated to the Skabelund maximal curve constructed as a cyclic cover of the Suzuki curve. In order to estimate the minimum distance of such codes, we make use of the generalized order bound introduced by P. Beelen and determine certain two-point Weierstrass semigroups of the curve. Leonardo Landi, Marco Timpanella, Lara Vicino |
IEEE Trans. Inf. Theory | 3 |