Covering radii are not matroid invariants

Thomas Johann Britz, Carrie G. Rutherford

    Research output: Book/ReportReportResearch

    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

    Cite this

    Britz, T. J., & Rutherford, C. G. (2005). Covering radii are not matroid invariants. Department of Mathematics, Technical University of Denmark. MAT-Rapport, No. 2005-12