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).
|Place of Publication||Lyngby|
|Publisher||Department of Mathematics, Technical University of Denmark|
|Number of pages||3|
|Publication status||Published - 2005|