Covering radii are not matroid invariants

Thomas Johann Britz; Carrie G. Rutherford

doi:10.1016/j.disc.2005.03.002

Covering radii are not matroid invariants

Thomas Johann Britz
, Carrie G. Rutherford

Research output: Contribution to journal › Journal article › Research › peer-review

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
Journal	Discrete Mathematics
Volume	296
Issue number	1
Pages (from-to)	117 – 120
ISSN	0012-365X
DOIs	https://doi.org/10.1016/j.disc.2005.03.002
Publication status	Published - 28 Jun 2005

Keywords

linear code
vector matroid
Tutte polynomial
covering radius

Access to Document

10.1016/j.disc.2005.03.002

OpenUrl availability

Full text

Cite this

@article{9486161fa4a84c0ab0c7ac14f31a4f41,

title = "Covering radii are not matroid invariants",

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).",

keywords = "linear code, vector matroid, Tutte polynomial, covering radius",

author = "Britz, \{Thomas Johann\} and Rutherford, \{Carrie G.\}",

year = "2005",

month = jun,

day = "28",

doi = "10.1016/j.disc.2005.03.002",

language = "English",

volume = "296",

pages = "117 – 120",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Covering radii are not matroid invariants

AU - Britz, Thomas Johann

AU - Rutherford, Carrie G.

PY - 2005/6/28

Y1 - 2005/6/28

N2 - 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).

AB - 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).

KW - linear code

KW - vector matroid

KW - Tutte polynomial

KW - covering radius

U2 - 10.1016/j.disc.2005.03.002

DO - 10.1016/j.disc.2005.03.002

M3 - Journal article

SN - 0012-365X

VL - 296

SP - 117

EP - 120

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1

ER -

Covering radii are not matroid invariants

Abstract

Keywords

Access to Document

OpenUrl availability

Fingerprint

Cite this