| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9512205 | Discrete Mathematics | 2005 | 4 Pages |
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).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Thomas Britz, Carrie G. Rutherford,