Covering radii are not matroid invariants
Journal article
Britz, T. and Rutherford, C. (2005). Covering radii are not matroid invariants. 296 (1), pp. 117-120. https://doi.org/10.1016/j.disc.2005.03.002
Authors | Britz, T. and Rutherford, C. |
---|---|
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). |
Year | 2005 |
Journal citation | 296 (1), pp. 117-120 |
Publisher | Elsevier |
ISSN | 0012-365X |
Digital Object Identifier (DOI) | https://doi.org/10.1016/j.disc.2005.03.002 |
Publication dates | |
28 Jun 2005 | |
Online | 12 May 2005 |
Publication process dates | |
Accepted | 01 Mar 2005 |
Deposited | 04 Nov 2019 |
Publisher's version | License File Access Level Open |
Permalink -
https://openresearch.lsbu.ac.uk/item/885xq
Download files
74
total views111
total downloads0
views this month0
downloads this month