Derivative Descendants and Ascendants of Binary Cyclic Codes, and Derivative Decoding

09/19/2022
by   Bin Zhang, et al.
0

This paper defines derivative descendants and ascendants of extended cyclic codes from the derivative of the Mattson-Solomon polynomials. It proves that the derivative descendants of an extended cyclic code in different directions are the same. It allows us to perform soft-decision decoding on extended cyclic codes based on the soft-decision decoding of their descendants. Simulation results show that its performance over certain extended cyclic codes, including some extended BCH codes, can be close to that of the maximum likelihood decoding.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2021

On Hard and Soft Decision Decoding of BCH Codes

Cyclic codes have the advantage that it is only necessary to store one p...
research
04/04/2019

Steiner systems S(2,4,2^m) for m ≡ 0 4 supported by a family of extended cyclic codes

In [C. Ding, An infinite family of Steiner systems S(2,4,2^m) from cycli...
research
01/09/2020

On Decoding Using Codewords of the Dual Code

We present novel decoding schemes for hard and soft decision decoding of...
research
09/06/2018

Tight MIP formulations for bounded length cyclic sequences

We study cyclic binary strings with bounds on the lengths of the interva...
research
04/05/2022

Theoretical analysis of the extended cyclic reduction algorithm

The extended cyclic reduction algorithm developed by Swarztrauber in 197...
research
05/12/2021

Cyclically Equivariant Neural Decoders for Cyclic Codes

Neural decoders were introduced as a generalization of the classic Belie...
research
02/09/2017

Cyclic Dominance in the Spatial Coevolutionary Optional Prisoner's Dilemma Game

This paper studies scenarios of cyclic dominance in a coevolutionary spa...

Please sign up or login with your details

Forgot password? Click here to reset