2026-04-27T13:49:49Zhttps://uvadoc.uva.es/oai/request

oai:uvadoc.uva.es:10324/317372024-12-18T15:53:22Zcom_10324_1129com_10324_931com_10324_894col_10324_1193

Geil, Olav Martin, Stefano Matsumoto, Ryutaroh Ruano Benito, Diego Luo, Yuan 2018-09-25T09:41:20Z 2018-09-25T09:41:20Z 2014 IEEE Transactions on Information Theory. Volume 60, Issue 10, pages 5938-5949 (2014) http://uvadoc.uva.es/handle/10324/31737 10.1109/TIT.2014.2345375 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. eng info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-nd/4.0/ Attribution-NonCommercial-NoDerivatives 4.0 International Relative generalized Hamming weights of one-point algebraic geometric codes info:eu-repo/semantics/article