IDEAS home Printed from https://ideas.repec.org/a/igg/jncr00/v10y2021i1p15-27.html
   My bibliography  Save this article

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

Author

Listed:
  • My Seddiq El Kasmi Alaoui

    (LIMSAD Laboratory, Faculty of Sciences Ain Chock, Hassan II University, Casablanca, Morocco)

  • Said Nouh

    (TIM Lab, Faculty of Sciences Ben M'sik, Hassan II University, Casablanca, Morocco)

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 comparison results show that the proposed decoder guarantees very good performances, compared to several competitors, with a much-reduced number of codewords of the dual code. For example, for the BCH(31, 16, 7) code, the good results found are based only on 3.66% of the all codewords of the dual code space, for the same code the reduction rate of the run time varies between 78% and 90% comparing to the use of Hartmann and Rudolph alone. This shows the efficiency, the rapidity, and the reduction of the memory space necessary for the proposed concatenation.

Suggested Citation

  • My Seddiq El Kasmi Alaoui & Said Nouh, 2021. "Decoding Algorithm by Cooperation Between Hartmann Rudolph Algorithm and a Decoder Based on Syndrome and Hash," International Journal of Natural Computing Research (IJNCR), IGI Global, vol. 10(1), pages 15-27, January.
    • Handle: RePEc:igg:jncr00:v:10:y:2021:i:1:p:15-27
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJNCR.2021010102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jncr00:v:10:y:2021:i:1:p:15-27. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.