49 citations · 61 across the 5 of their papers we have counts for
7 papers
Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower
Olav Geil, Stefano Martin, Umberto Martínez-Peñas +1
Asymptotically good sequences of ramp secret sharing schemes were given in [Asymptotically good ramp secret sharing schemes, arXiv:1502.05507] by using one-point algebraic geometri…
On asymptotically good ramp secret sharing schemes
Olav Geil, Stefano Martin, Umberto Martínez-Peñas +2
Asymptotically good sequences of linear ramp secret sharing schemes have been intensively studied by Cramer et al. in terms of sequences of pairs of nested algebraic geometric code…
Relative generalized Hamming weights of q-ary Reed-Muller codes
Olav Geil, Stefano Martin
Coset constructions of -ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the sys…
Relative generalized Hamming weights of one-point algebraic geometric codes
Olav Geil, Stefano Martin, Ryutaroh Matsumoto +2
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…
An improvement of the Feng-Rao bound for primary codes
Olav Geil, Stefano Martin
We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised C_{ab} curves the new bound often improves drama…
Further improvements on the Feng-Rao bound for dual codes
Olav Geil, Stefano Martin
Salazar, Dunn and Graham in [Salazar et. al., 2006] presented an improved Feng-Rao bound for the minimum distance of dual codes. In this work we take the improvement a step further…