| Original language | English |
|---|---|
| Pages (from-to) | 317-329 |
| Number of pages | 13 |
| Journal | Semigroup Forum |
| Volume | 73 |
| Issue number | 3 |
| Publication status | Published - 2006 |
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver
An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
- J Cazaran
- , Andrei Kelarev
- , Stephen Quinn
- , D Vertigan
Research output: Contribution to journal › Article › peer-review
23
Citations
(Scopus)