Permutation decoding: Towards an approach using algebraic properties of the -subcode
Résumé
In this paper, we show a manner to use properties of the permutation group on some binary linear codes to improve the decoding algorithms. We search especially for articular permutations and we prove bounds on dimension of a special subcode of the idempotent sub-code. This -subcode can have very lower dimension in practice than the original code. We give several examples at the end and explain what can be the gain with this way of decoding.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...