Polycyclic codes as invariant subspaces.
Résumé
Polycyclic codes are a powerful generalization of cyclic and constacyclic codes. Their algebraic structure is studied here by the theory of invariant subspaces from linear algebra. As an application, a bound on the minimum distance of these codes is derived which outperforms, in some cases, the natural analogue of the BCH bound.
Domaines
Mathématiques [math]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...