Covering radii are not matroid invariants

Thomas Britz; Carrie G. Rutherford

doi:10.1016/j.disc.2005.03.002

Covering radii are not matroid invariants

Thomas Britz, Carrie G. Rutherford

London South Bank University

Research output: Contribution to journal › Article › peer-review

9 Citations (Scopus)

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
Pages (from-to)	117-120
Number of pages	4
Journal	Default journal
Volume	296
Issue number	1
DOIs	https://doi.org/10.1016/j.disc.2005.03.002 https://doi.org/10.1016/j.disc.2005.03.002
Publication status	Published - 28 Jun 2005

Keywords

Covering radius
Linear code
Tutte polynomial
Vector matroid

Access to Document

Cite this

@article{1ef7bc9ec7d14cbfbf399d9beabab11a,

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 = "Covering radius, Linear code, Tutte polynomial, Vector matroid",

author = "Thomas Britz 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 = "Default journal",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Covering radii are not matroid invariants

AU - Britz, Thomas

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 - Covering radius

KW - Linear code

KW - Tutte polynomial

KW - Vector matroid

UR - https://www.scopus.com/pages/publications/19944364248

U2 - 10.1016/j.disc.2005.03.002

DO - 10.1016/j.disc.2005.03.002

M3 - Article

SN - 0012-365X

VL - 296

SP - 117

EP - 120

JO - Default journal

JF - Default journal

IS - 1

ER -

Covering radii are not matroid invariants

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this