Fast decoding of binary quadratic residue codes
Résumé
In a recent article, Yi et al. proposed an algorithm for the decoding of binary quadratic residue codes with memory requirements. In this letter, this algorithm is modified in order to dramatically improve the decoding speed. The case of the (89,45,17) binary quadratic residue code is used to illustrate the new algorithm.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|