Computer Science – Information Theory
Scientific paper
2006-06-08
IEEE Transactions on Communications, Volume 50, Issue 11, Nov. 2002, Pages:1709 - 1711
Computer Science
Information Theory
6 pages. IEEE Transactions on Communications
Scientific paper
10.1109/TCOMM.2002.805269
We propose an improved algorithm for finding roots of polynomials over finite
fields. This makes possible significant speedup of the decoding process of
Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting
codes.
Fedorenko Sergei V.
Trifonov Piter V.
No associations
LandOfFree
Finding roots of polynomials over finite fields 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 Finding roots of polynomials over finite fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding roots of polynomials over finite fields will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-506864