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)

Cite this

@article{43f528c349984763bf2112930ced5162,

title = "An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings",

author = "J Cazaran and Andrei Kelarev and Stephen Quinn and D Vertigan",

year = "2006",

language = "English",

volume = "73",

pages = "317--329",

journal = "Semigroup Forum",

issn = "0037-1912",

publisher = "Springer New York",

number = "3",

}