2014•RUNE (Research UNE)Requires access

Sequential Decoding of Reed-Solomon Codes

Vera Miloslavskaya, Peter Trifonov, Saint-Petersburg State

Abstract

The problem of efficient soft-decision decoding of Reed-Solomon codes is considered. Low-complexity sequential algorithm was recently proposed for decoding of polar codes. A generalization of this algorithm to the case of Reed-Solomon codes, represented as polar codes with dynamic frozen symbols, is proposed. Simplification of the proposed decoding algorithm to the case of transmission of binary image of Reed-Solomon code is derived.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 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

Key concepts: Reed–Solomon error correction, Berlekamp–Welch algorithm, List decoding, Sequential decoding, Decoding methods, Concatenated error correction code, Reed–Muller code, BCJR algorithm