2021
DOI: 10.4018/ijncr.2021010102
|View full text |Cite
|
Sign up to set email alerts
|

Decoding Algorithm by Cooperation Between Hartmann Rudolph Algorithm and a Decoder Based on Syndrome and Hash

Abstract: In this paper, the authors present a concatenation of Hartmann and Rudolph (HR) partially exploited and a decoder based on hash techniques and syndrome calculation to decode linear block codes. This work consists firstly to use the HR with a reduced number of codewords of the dual code then the HWDec which exploits the output of the HR partially exploited. Researchers have applied the proposed decoder to decode some Bose, Chaudhuri, and Hocquenghem (BCH) and quadratic residue (QR) codes. The simulation and com… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…There are other methods that use non-algebraic techniques, such as genetic algorithms that belong to evolutionary techniques [18]- [19]. We have also found a work that uses local search to find errors [20]- [21].…”
Section: Related Workmentioning
confidence: 91%
See 1 more Smart Citation
“…There are other methods that use non-algebraic techniques, such as genetic algorithms that belong to evolutionary techniques [18]- [19]. We have also found a work that uses local search to find errors [20]- [21].…”
Section: Related Workmentioning
confidence: 91%
“…Figure 4 presents the main classes of decoding techniques. Some decoders are based on algebraic theory such as the algorithms developed through solving nonlinear multivariate equations obtained from the identities of Newton [13]- [14], the Berlekamp-Massey algorithm [15] which is based on the calculation of syndromes and the definition of an error locator polynomial, the algorithm of Chase [16] and the algorithm of Hartmann Rudolf [17]- [18]. However, some algebraic techniques, aforementioned, require a large wide of computational operations, in terms of sum and product, in the used finite field.…”
Section: Related Workmentioning
confidence: 99%