On the List and Bounded Distance Decodibility of the Reed-Solomon Codes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In 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.

Keywords

Number Theory, Information Theory, 11Y16; 68Q25

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/134372

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0405082
 http://arxiv.org/abs/math/0405082

Collections

arXiv