EDBT 2026 Demo / reviewers in the wild / expert

Stefano Martin

dblp:116/5236 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2015
0000-0002-5618-8669ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3Security and privacy · 1

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%
Network and information security
1 paper
Cryptographic protocols and secure computation · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic geometry code		 0.212014
Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes · IEEE Trans. Inf. Theory 2014
Coding theory
generalized hamming weights		 0.212014
Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes · IEEE Trans. Inf. Theory 2014
Coding theory › generalized hamming weights
relative generalized hamming weight		 0.212014
Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes · IEEE Trans. Inf. Theory 2014
Cryptographic protocols and secure computation › secret sharing
ramp secret sharing		 0.112014
Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes · IEEE Trans. Inf. Theory 2014
Cryptographic protocols and secure computation
secret sharing		 0.112014
Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes · IEEE Trans. Inf. Theory 2014

Methods — techniques the papers use, named apart from their topics

bound estimation · 0.4
YearPublicationVenuePosition
2015 An improvement of the Feng-Rao bound for primary codes
Olav Geil, Stefano Martin
 Des. Codes Cryptogr.2
2014 Relative generalized Hamming weights of one-point algebraic geometric codes
abstract
Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes [23], [22]. In this paper we elaborate on the implication of these parameters and we devise a method to estimate their value for general one-point algebraic geometric codes. As it is demonstrated, for Hermitian codes our bound is often tight. Furthermore, for these codes the relative generalized Hamming weights are often much larger than the corresponding generalized Hamming weights.
Olav Geil, Stefano Martin, Ryutaroh Matsumoto, Diego Ruano, Yuan Luo 0003
 ITW2
2014 Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes
abstract
Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes. In this paper, we elaborate on the implication of these parameters and devise a method to estimate their value for general one-point algebraic geometric codes. As it is demonstrated, for Hermitian codes, our bound is often tight. Furthermore, for these codes, the relative generalized Hamming weights are often much larger than the corresponding generalized Hamming weights.
Olav Geil, Stefano Martin, Ryutaroh Matsumoto, Diego Ruano, Yuan Luo 0003
 IEEE Trans. Inf. Theory2
2012 A New Method for Constructing Small-Bias Spaces from Hermitian Codes
Olav Geil, Stefano Martin, Ryutaroh Matsumoto
 WAIFI2