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

Authors: Cazaran, J.1; Kelarev, A.V.2; Quinn, S.J.3; Vertigan, D.4

Source: Semigroup Forum, Volume 73, Number 3, December 2006 , pp. 317-329(13)

Publisher: Springer

Buy & download fulltext article:

OR

Price: $47.00 plus tax (Refund Policy)

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.

Document Type: Research Article

DOI: http://dx.doi.org/10.1007/s00233-006-0647-9

Affiliations: 1: Email: cazaran@math.lsu.edu 2: Email: andrei.kelarev@utas.edu.au 3: Email: stephen.quinn@utas.edu.au 4: Email: vertigan@math.lsu.edu

Publication date: December 1, 2006

Related content

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page