Library Open Repository

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

Downloads

Downloads per month over past year

Cazaran, J and Kelarev, A and Quinn, S and Vertigan, D (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

[img] PDF
kelarev2006.pdf | Request a copy
Full text restricted
Available under University of Tasmania Standard License.

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
Journal or Publication Title: Semigroup Forum
Page Range: pp. 317-329
ISSN: 0037-1912
Identification Number - DOI: 10.1007/s00233-006-0647-9
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.
Date Deposited: 02 Apr 2007
Last Modified: 18 Nov 2014 03:13
URI: http://eprints.utas.edu.au/id/eprint/893
Item Statistics: View statistics for this item

Repository Staff Only (login required)

Item Control Page Item Control Page