An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings (Q871618): Difference between revisions

This paper is devoted to developing a new algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings as ideals. The algorithm relies on a more general technical result of independent interest concerning extensions of cyclic codes embedded in semigroup rings. The author confines to a finite commutative semigroup \(S\). Most of the previus papers by other authors have dealt with the case where \(S\) is an Abelian group. This paper is devoted to the next natural step and handles the complementary case where \(S\) is a semilattice.