By Topic

The fast decoding of Reed-Solomon codes using Fermat transforms (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

It is shown that \sqrt [8]{2} is an element of order 2^{n+4} in GF(F_{n}) , where F_{n}=2^{2^{n}}+1 is a Fermat prime for n=3,4 . Hence it can be used to define a fast Fourier transform (FFT) of as many as 2^{n+4} symbols in GF(F_{n}) . Since \sqrt [8]{2} is a root of unity of order 2^{n+4} in GF(F_{n}) , this transform requires fewer muitiplications than the conventional FFT algorithm. Moreover, as Justesen points out [1], such an FFT can be used to decode certain Reed-Solomon codes. An example of such a transform decoder for the case n=2 , where \sqrt {2} is in GF(F_{2})=GF(17) , is given.

Published in:

IEEE Transactions on Information Theory  (Volume:24 ,  Issue: 4 )