Covering radii are not matroid invariants

Thomas Johann Britz, Carrie G. Rutherford

    Research output: Contribution to journalJournal articleResearchpeer-review

    Abstract

    We show by example that the covering radius of a binary linear code is not generally determined by the Tutte polynomial of the matroid. This answers Problem 361 (P.J. Cameron (Ed.), Research problems, Discrete Math. 231 (2001) 469–478).
    Original languageEnglish
    JournalDiscrete Mathematics
    Volume296
    Issue number1
    Pages (from-to)117 – 120
    ISSN0012-365X
    DOIs
    Publication statusPublished - 28 Jun 2005

    Keywords

    • linear code
    • vector matroid
    • Tutte polynomial
    • covering radius

    Fingerprint Dive into the research topics of 'Covering radii are not matroid invariants'. Together they form a unique fingerprint.

    Cite this