University of Tasmania
Browse
kelarev2006.pdf (341.35 kB)

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

Download (341.35 kB)
journal contribution
posted on 2023-05-16, 19:06 authored by Cazaran, J, Kelarev, AV, Quinn, SW, Vertigan, D
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. © Springer 2006.

Funding

Australian Research Council

History

Publication title

Semigroup Forum

Volume

73

Pagination

317-329

ISSN

0037-1912

Department/School

School of Information and Communication Technology

Publisher

Springer New York LLC

Place of publication

United States

Repository Status

  • Restricted

Socio-economic Objectives

Network infrastructure equipment

Usage metrics

    University Of Tasmania

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC