Boualame, H. and Chana, I. and Belkasmi, M. (2018) New efficient decoding algorithm of the (17, 9, 5) quadratic residue code. In: UNSPECIFIED.

Full text not available from this repository.
Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....

Abstract

In recent years, the decoding of quadratic residue (QR) codes has attracted a wide attention, considering their good properties in terms of minimal distance and special mathematic structure that make them one of the most known subclasses of codes in the family of cyclic codes. These codes are known for their complicated decoding procedure and the difficult hardware implementation. In this paper, we propose a new decoding method to decode the (17,9,5) quadratic residue code. This method does require neither the computation of the unknown syndromes nor the error-locator polynomial, instead, it decodes the discussed code by using a simple way to locate the position of the errors. To ensure the validity of the proposed method, we tested all the possible error patterns. and the results were very satisfying since the proposed decoder corrected all of them. So, we declare that this decoder can surely decode up to the to correcting capacity of this code. © 2018 IEEE.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Uncontrolled Keywords: Binary codes; Errors; Hardware; Mergers and acquisitions, Correcting capacity; Decoding algorithm; Error locator polynomial; Error patterns; Hardware implementations; Quadratic residue codes; Quadratic residues; Syndrome decoding, Decoding
Subjects: Computer Science
Divisions: SCIENTIFIC PRODUCTION > Computer Science
Depositing User: Administrateur Eprints Administrateur Eprints
Last Modified: 31 Jan 2020 15:46
URI: http://eprints.umi.ac.ma/id/eprint/2364

Actions (login required)

View Item View Item