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).
Discrete Mathematics, 2005, Vol 296, Issue 1
; linear code; vector matroid; Tutte polynomial; covering radius