No Detail Found!

High speed decoding by collaboration between the hartmann rudolph and information set decoding algorithms

Author(s)
HAMZA FAHAM LTIM Lab, Ben M'sick Sciences Faculty, Hassan II University of Casablanca, Morocco
MY SEDDIQ EL KASMI ALAOUI LIS Lab, Aïn Chock Sciences Faculty, Hassan II University of Casablanca, Morocco
SAÏD NOUH LTIM Lab, Ben M'sick Sciences Faculty, Hassan II University of Casablanca, Morocco
MOHAMED AZZOUAZI LTIM Lab, Ben M'sick Sciences Faculty, Hassan II University of Casablanca, Morocco
ISSAM ABDERRAHMANE JOUNDAN LTIM Lab, Ben M'sick Sciences Faculty, Hassan II University of Casablanca, Morocco
Abstract
Decoders are implemented to retrieve data after its transmission over a noisy communication channel. Soft decision decoders are highly efficient in concatenation schemes exploiting more than one decoding level. In our case, we concatenated the symbol-by-symbol Hartmann Rudolph (HR) decoding algorithm and the Information Set Decoding (ISD) technique that is a word-to-word decoding. In this work, we will suggest to concatenate HR partially exploited (PHR) and the ISD technique in order to decode linear block codes. We will use firstly the HR decoder with a reduced number of dual codewords then the ISD, which uses the output of PHR. We noticed that the suggested serial concatenation guarantees very high performances with less dual codewords number. For instance for the QR(31, 16, 7) code, the satisfying obtained results are based only on 2,74% of the dual codewords. For the same code, we have minimized the runtime by 95% compared to the use of HR alone. This proves the power and the speed of the suggested concatenation.
Publication Details
Page(s) 5377-5385
DOI DOI not available
Published Journal: Journal of Theoretical and Applied Information Technology, Volume: 100, Issue: 17, Year: 2022

Request the full text from PASTIC

Keywords
Information Set Decoding, Information Theory, Error Correcting Codes, PHR, Hartmann Rudolph (HR)
0

Citations

0

Downloads

43

Views