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

From MaRDI portal
Publication:871618

DOI10.1007/s00233-006-0647-9zbMath1145.94023OpenAlexW2017758698MaRDI QIDQ871618

Dirk Vertigan, Stephen Quinn, Jilyana Cazaran, Andrei V. Kelarev

Publication date: 20 March 2007

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-006-0647-9




Related Items




This page was built for publication: An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings