2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/134372In this paper show that the list and bounded-distance decoding problems of certain bounds for the Reed-Solomon code are at least as hard as the discrete logarithm problem over finite fields.Number TheoryInformation Theory11Y16; 68Q25On the List and Bounded Distance Decodibility of the Reed-Solomon Codestext