2026-06-01T02:24:15Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/1262092025-11-20T01:17:51Zcom_20.500.14352_14col_20.500.14352_15

Algorithm for computing minimum distance Rodríguez Palanquex, María Cruz García Villalba, L. J. Montoya Vitini, F. 510.5 519.712 Estadística Estadística matemática (Matemáticas) 1207 Investigación Operativa 1209 Estadística A new class of curves, the so-called quasi-Hermitian curves, on Fq (with q = 2j) are presented. An algorithm which enables the exact minimum distance for the corresponding Goppa codes to be determined is also presented. This work leads to the possibility of constructing new versions of such codes. Depto. de Análisis Matemático y Matemática Aplicada Fac. de Estudios Estadísticos TRUE pub 2025-11-19T08:37:21Z 2025-11-19T08:37:21Z 1999-06 journal article VoR https://hdl.handle.net/20.500.14352/126209 XXXX-XXXX 10.1049/el:19991017 eng Rodriguez-Palanquex, M. C. Algorithm for computing minimum distance. Electronics Letters. 1999: 35 (18) Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/ restricted access application/pdf IEEE