Skip to main content
Article thumbnail
Location of Repository

On the Root Finding Step in List Decoding of Folded Reed-Solomon Codes

By Peter Trifonov

Abstract

The root finding step of the Guruswami-Rudra list decoding algorithm for folded Reed-Solomon codes is considered. It is shown that a multivariate generalization of the Roth-Ruckenstein algorithm can be used to implement it. This leads to an improved bound on the size of the list produced by the decoder, as well as enables one to relax the constraints on the parameters of folded codes. Furthermore, the class of time-domain folded Reed-Solomon codes is introduced, which can be efficiently list decoded with the Guruswami-Rudra algorithm, and provides greater flexibility in parameter selection than the classical (frequency-domain) folded codes.Comment: Not accepted to IEEE Int. Symposium on Information Theory, 201

Topics: Computer Science - Information Theory
Year: 2013
OAI identifier: oai:arXiv.org:1103.1958
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1103.1958 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.