An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
type: Item
instance of: scholarly article
title: An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
zbMATH Open document ID: 1145.94023
published in: Semigroup Forum
publication date: 2007-03-20T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 94B60
Mathematics Subject Classification ID: 16S35
zbMATH DE Number: 5134742
zbMATH Keywords: extensions of cyclic codes
author: Jilyana Cazaran
author: A. V. Kelarev
author: Stephen J. Quinn
author: Dirk Vertigan
reviewed by: Bai Kishan Dass
MaRDI profile type: Publication
full work available at URL: s00233-006-0647-9
OpenAlex ID: W2017758698
DOI: 10.1007/S00233-006-0647-9
description: scientific article; zbMATH DE number 5134742