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 language | English |
---|---|
Pages (from-to) | 117-120 |
Journal | Default journal |
DOIs | |
Publication status | Published - 28 Jun 2005 |