An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings

Cazaran, Jilyana and Kelarev, Andrei and Quinn, Stephen and Vertigan, Dirk (2006) An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings. Semigroup Forum, 73 . pp. 317-329. ISSN 0037-1912

PDF - Full text restricted - Requires a PDF viewer
341Kb

Official URL: http://dx.doi.org/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.

Item Type:	Article
Additional Information:	Journal HomePage: http://www.springerlink.com/link.asp?id=103374. Our joint work on this project started during a visit ofthe first and fourth authors to the University of Tasmania on sabbatical from Louisiana State University in 2003. The second and third authors have been supported by Australian Research Council, Discovery grant DP0449469.
Subjects:	280000 Information, Computing and Communication Sciences > 280100 Information Systems > 280110 Systems Theory 280000 Information, Computing and Communication Sciences > 280100 Information Systems > 280103 Information Storage, Retrieval and Management 280000 Information, Computing and Communication Sciences > 280500 Data Format > 280506 Coding and Information Theory
ID Code:	893
Deposited By:	Dr Andrei Kelarev
Deposited On:	02 Apr 2007
Last Modified:	09 Jan 2008 02:30
ePrint Statistics:	View statistics for this ePrint

Repository Staff Only: item control page