An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings (Q871618): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 01:26, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings |
scientific article |
Statements
An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings (English)
0 references
20 March 2007
0 references
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.
0 references
extensions of cyclic codes
0 references