Most of existing methods to identify the Reed-solomon (RS) codes, commonly applied as channel codes, mainly focus on non-shortened RS codes. In this paper, a method to identify the shortened RS codes with short codeword length is proposed. Firstly, based on Gauss-Jordan elimination through pivoting (GJETP), the codeword length of shortened RS codes is identified. The shortened RS codewords are zeroized by estimating the order of finite field and the number of shortened symbols. Then, the Chinese remainder theorem(CRT) based algorithm is adopted to identify the primitive polynomial. Finally, the generator polynomial is obtained based on Galois field Fourier transform (GFFT). The simulation experiments are carried out showing that the probability of recognition of shortened RS codes is higher than 90% with bit error rate (BER) less than 5×10-3 , which demonstrates the viability of the proposed recognition approach.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.