ScholarLens Back to search
2014•Problems of Information TransmissionRequires access

Successive cancellation decoding of Reed-Solomon codes

Peter Trifonov

Open publisher page 6 citations

Abstract

A novel soft-decision decoding algorithm for Reed-Solomon codes over GF(2 m ) 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.

About this research paper

What this paper is about

A novel soft-decision decoding algorithm for Reed-Solomon codes over GF(2 m ) 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.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A novel soft-decision decoding algorithm for Reed-Solomon codes over GF(2 m ) 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.

Key concepts: Reed–Solomon error correction, Decoding methods, Mathematics, Code (set theory), Arithmetic, Binary number, Berlekamp–Welch algorithm, Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Successive cancellation decoding of Reed-Solomon codes — Research Paper | ScholarLens