Covering radii are not matroid invariants

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)

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
Pages (from-to)117-120
JournalDefault journal
DOIs
Publication statusPublished - 28 Jun 2005

Fingerprint

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

Cite this