eCite Digital Repository

An Algorithm for Computing the Minimum Distances of Extensions of BCH Codes Embedded in Semigroup Rings

Citation

Cazaran, J and Kelarev, AV and Quinn, SW and Vertigan, D, An Algorithm for Computing the Minimum Distances of Extensions of BCH Codes Embedded in Semigroup Rings , Semigroup Forum, 73, (3) pp. 317-329. ISSN 0037-1912 (2006) [Refereed Article]

DOI: doi:10.1007/s00233-006-0647-9

Abstract

An algorithm is given for computing the weights of extensions of BCH codes embedded in semigroup rings as ideals. The algorithm relies on a more general technical result of independent interest. © Springer 2006.

Item Details

Item Type:Refereed Article
Research Division:Information and Computing Sciences
Research Group:Theory of computation
Research Field:Coding, information theory and compression
Objective Division:Manufacturing
Objective Group:Computer, electronic and communication equipment
Objective Field:Network infrastructure equipment
UTAS Author:Kelarev, AV (Dr Andrei Kelarev)
UTAS Author:Quinn, SW (Mr Scott Quinn)
ID Code:44146
Year Published:2006
Funding Support:Australian Research Council (DP0449469)
Web of Science® Times Cited:23
Deposited By:Computing
Deposited On:2007-04-30
Last Modified:2007-04-30
Downloads:0

Repository Staff Only: item control page