Volume 73, Number 3, 317-329, DOI: 10.1007/s00233-006-0647-9

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

J. Cazaran, A.V. Kelarev, S.J. Quinn and D. Vertigan

View Related Documents

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.

Fulltext Preview

Image of the first page of the fulltext document