Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth’s second tower
Keywords:
Algebraic geometric codes, Asymptotically good ramp secret sharing schemes, Generalized Hamming weights, Relative generalized Hamming weights, Secret sharingAbstract
Asymptotically good sequences of ramp secret sharing schemes were given in [5] 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.
Downloads
References
M. Bras-Amorós and M. O’Sullivan, The order bound on the minimum distance of the one–point codes associated to the Garcia–Stichtenoth second tower, IEEE Trans. Inform. Theory 53(11) (2007) 4241–4246.
H. Chen, R. Cramer, S. Goldwasser, R. de Haan, and V. Vaikuntanathan, Secure computation from random error correcting codes, in: M. Naor (Ed.), Advances in Cryptology – EUROCRYPT 2007, Lecture Notes in Computer Science, vol. 4515, Springer, Berlin, Heidelberg, 2007, pp. 291–310.
A. Garcia and H. Stichtenoth, On the asymptotic behaviour of some towers of function fields over finite fields, J. Number Theory 61(2) (1996) 248–273.
O. Geil and S. Martin, Relative generalized Hamming weights of $q$–ary Reed–Muller codes, Adv. Math. Commun. 11(3) (2017) 503–531.
O. Geil, S. Martin, U. Martínez-Peñas, R. Matsumoto, and D. Ruano, On asymptotically good ramp secret sharing schemes from algebraic geometry codes, IEICE Trans. Fundamentals E100-A(12) (2017) 2699–2707.
O. Geil, S. Martin, R. Matsumoto, D. Ruano, and Y. Luo, Relative generalized Hamming weights of one-point algebraic geometric codes, in: 2014 IEEE Information Theory Workshop (ITW 2014), IEEE, 2014, pp. 77–81.
J. Kurihara, T. Uyematsu, and R. Matsumoto, Secret sharing schemes based on linear codes can be precisely characterized by relative generalized Hamming weights, IEICE Trans. Fundamentals E95-A(11) (2012) 2067–2075.
Z. Liu, W. Chen, and Y. Luo, The relative generalized Hamming weight of linear $q$–ary codes and their subfield subcodes, Des. Codes Cryptogr. 48(2) (2008) 111–123.
Y. Luo, C. Mitrpant, A. J. Han Vinck, and K. Chen, Some new characters on the wire–tap channel of type II, IEEE Trans. Inform. Theory 51(3) (2005) 1222–1229.
R. Pellikaan, H. Stichtenoth, and F. Torres, Weierstrass semigroups in an asymptotically good tower of function fields, Finite Fields Appl. 4(4) (1998) 381–392.
M. A. Tsfasman and S. G. Vlăduţ, Geometric approach to higher weights, IEEE Trans. Inform. Theory 41(6) (1995) 1564–1588.
J. Zhang and K. Feng, Relative generalized Hamming weights of cyclic codes and their subfield subcodes, J. Algebra Appl. 14(9) (2015) 1550080.
