The maximum number of minimal codewords in an [n, k]-code

A. Alahmadi; R. E. L. Aldred; R. de la Cruz; P. Solé; Carsten Thomassen

doi:10.1016/j.disc.2013.03.023

The maximum number of minimal codewords in an [n, k]-code

A. Alahmadi
, R. E. L. Aldred
, R. de la Cruz
, P. Solé
, Carsten Thomassen

Department of Applied Mathematics and Computer Science

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

Abstract

We survey some upper and lower bounds on the function in the title, and make them explicit for n≤15 and 1≤k≤15. Exact values are given for cycle codes of graphs for 3≤n≤15 and 1≤k≤13.

Original language	English
Journal	Discrete Mathematics
Volume	313
Issue number	15
Pages (from-to)	1569-1574
ISSN	0012-365X
DOIs	https://doi.org/10.1016/j.disc.2013.03.023
Publication status	Published - 2013

Keywords

Minimal codewords
Intersecting codes
Matroid theory
Cycle code of graphs

Access to Document

10.1016/j.disc.2013.03.023

OpenUrl availability

Full text

Cite this

@article{903452fd5c8f47c78ec51f06f5a92b6a,

title = "The maximum number of minimal codewords in an [n, k]-code",

abstract = "We survey some upper and lower bounds on the function in the title, and make them explicit for n≤15 and 1≤k≤15. Exact values are given for cycle codes of graphs for 3≤n≤15 and 1≤k≤13.",

keywords = "Minimal codewords, Intersecting codes, Matroid theory, Cycle code of graphs",

author = "A. Alahmadi and Aldred, \{R. E. L.\} and \{de la Cruz\}, R. and P. Sol{\'e} and Carsten Thomassen",

year = "2013",

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

language = "English",

volume = "313",

pages = "1569--1574",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "15",

}

TY - JOUR

T1 - The maximum number of minimal codewords in an [n, k]-code

AU - Alahmadi, A.

AU - Aldred, R. E. L.

AU - de la Cruz, R.

AU - Solé, P.

AU - Thomassen, Carsten

PY - 2013

Y1 - 2013

N2 - We survey some upper and lower bounds on the function in the title, and make them explicit for n≤15 and 1≤k≤15. Exact values are given for cycle codes of graphs for 3≤n≤15 and 1≤k≤13.

AB - We survey some upper and lower bounds on the function in the title, and make them explicit for n≤15 and 1≤k≤15. Exact values are given for cycle codes of graphs for 3≤n≤15 and 1≤k≤13.

KW - Minimal codewords

KW - Intersecting codes

KW - Matroid theory

KW - Cycle code of graphs

U2 - 10.1016/j.disc.2013.03.023

DO - 10.1016/j.disc.2013.03.023

M3 - Journal article

SN - 0012-365X

VL - 313

SP - 1569

EP - 1574

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 15

ER -

The maximum number of minimal codewords in an [n, k]-code

Abstract

Keywords

Access to Document

OpenUrl availability

Fingerprint

Cite this