Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower [article]

Olav Geil, Stefano Martin, Umberto Martínez-Peñas, Diego Ruano
<span title="2015-11-19">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
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 geometric codes defined from asymptotically good towers of function fields. Their security is given by the relative generalized Hamming weights of the corresponding codes. In this paper we demonstrate how to obtain refined information on the RGHWs when the codimension of the codes is small. For general codimension, we give an improved estimate for the highest RGHW.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="">arXiv:1511.06230v1</a> <a target="_blank" rel="external noopener" href="">fatcat:h3xxmwiy2zbt3nxlby3cxt7voq</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="" title=" access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> </button> </a>