Successive cancellation decoding of Reed-Solomon codes
- 108 Downloads
A novel soft-decision decoding algorithm for Reed-Solomon codes over GF(2m) is proposed, which is based on representing them as polar codes with dynamic frozen symbols and applying the successive cancellation method. A further performance improvement is obtained by exploiting multiple permutations of codewords which are taken from the automorphism group of Reed-Muller codes. It is also shown that the proposed algorithm can be simplified in the case of decoding a binary image of the Reed-Solomon code.
Unable to display preview. Download preview PDF.
- 6.Tal, I. and Vardy, A., List Decoding of Polar Codes, in Proc. 2011 IEEE Int. Sympos. on Information Theory (ISIT’2011), St. Petersburg, Russia, July 31–August 5, 2011, pp. 1–5.Google Scholar
- 8.Trifonov, P. and Miloslavskaya, V., Polar Codes with Dynamic Frozen Symbols and Their Decoding by Directed Search, in Proc. 2013 IEEE Information Theory Workshop (ITW’2013), Sevilla, Spain, Sept. 9–13, 2013, pp. 1–5.Google Scholar