Covering radii are not matroid invariants

Thomas Johann Britz, Carrie G. Rutherford

    Research output: Book/ReportReport

    Abstract

    We show by example that the covering radius of a binary linear code is not generally determined the Tutte polynomial of the matroid. This answers Problem 361 (P. J. Cameron (ed.), Research problems, Discrete Math. 231 (2001) 469--478).
    Original languageEnglish
    Place of PublicationLyngby
    PublisherDepartment of Mathematics, Technical University of Denmark
    Number of pages3
    Publication statusPublished - 2005
    SeriesMAT-Rapport
    Number2005-12

    Fingerprint

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

    Cite this