On minimum distance bounds for abelian codes
type: Item
instance of: scholarly article
title: On minimum distance bounds for abelian codes
zbMATH Open document ID: 0762.94011
DOI: 10.1007/BF01268659
author: Roberta Evans Sabin
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 1993-04-01T00:00:00Z
review text: This paper presents two methods of formulating a lower bound for the minimum distance of a code which is an ideal in an Abelian group ring. Simple algorithms have been presented for (1) deriving the generalized BCH bound for an Abelian code, (2) determining direct sum decompositions of an Abelian code to concatenated codes, and (3) deriving a bound on an Abelian code, viewed as a direct sum of concatenated codes, by applying the cyclic BCH bound to the inner and outer code of each concatenation. The applicability of these methods to codes that are not ideals in Abelian group rings has also been pointed out.
reviewed by: Bai Kishan Dass
Mathematics Subject Classification ID: 94B60
zbMATH DE Number: 146888
zbMATH Keywords: Mattson-Solomon polynomials
zbMATH Keywords: lower bound
zbMATH Keywords: minimum distance
zbMATH Keywords: BCH bound
zbMATH Keywords: Abelian code
zbMATH Keywords: concatenated codes
MaRDI profile type: Publication
cites work: Q4068584
cites work: Q3213082
cites work: Q5340151
cites work: The concatenated structure of cyclic and Abelian codes
cites work: Q4088979
cites work: On the minimum distance of cyclic codes
cites work: Q4146667
cites work: Metacyclic error-correcting codes
description: scientific article; zbMATH DE number 146888