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

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

2011-03-10

arxiv.org/abs/1103.1958v2

Computer Science

Information Theory

Not accepted to IEEE Int. Symposium on Information Theory, 2011

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Root Finding Step in List Decoding of Folded Reed-Solomon Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Root Finding Step in List Decoding of Folded Reed-Solomon Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Root Finding Step in List Decoding of Folded Reed-Solomon Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-630535