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

From MaRDI portal
Set OpenAlex properties.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00233-006-0647-9 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017758698 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00233-006-0647-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017758698 / rank
 
Normal rank

Latest revision as of 08:36, 20 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
    0 references
    0 references
    0 references
    0 references

    Identifiers