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

Simple item page
dc.creatorCheng, Qi
dc.creatorWan, Daqing
dc.date2004-05-05
dc.date.accessioned2026-07-07T08:18:16Z
dc.date.available2026-07-07T08:18:16Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/math/0405082
dc.identifierhttp://arxiv.org/abs/math/0405082
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134372
dc.subjectNumber Theory
dc.subjectInformation Theory
dc.subject11Y16; 68Q25
dc.titleOn the List and Bounded Distance Decodibility of the Reed-Solomon Codes
dc.typetext

Files

Collections

arXiv