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.

中文翻译：

---

多环代码作为不变子空间

多环码是循环码和恒定码的强大概括。本文通过线性代数的不变子空间理论研究了它们的代数结构。作为一种应用，得出了这些代码的最小距离的界限，在某些情况下，该界限的性能优于BCH界限的自然类似物。