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

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

doi:10.1016/j.disc.2013.03.023

Back

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

Journal article

Open access

Peer reviewed

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

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

Discrete mathematics, Vol.313(15), pp.1569-1574

06/08/2013

DOI: https://doi.org/10.1016/j.disc.2013.03.023

Abstract

Cycle code of graphs

Intersecting codes

Matroid theory

Minimal codewords

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.

Files and links (1)

url

https://doi.org/10.1016/j.disc.2013.03.023View

Published (Version of record) Open

Metrics

1 Record Views

Details

Title: The maximum number of minimal codewords in an [n,k]-code
Creators - without role: A. Alahmadi - King Abdulaziz University
R.E.L. Aldred - University of Otago
R. de la Cruz - Nanyang Technological University
P. Solé - Télécom Paris
C. Thomassen - Technical University of Denmark
Publication Details: Discrete mathematics, Vol.313(15), pp.1569-1574
Publisher: Elsevier B.V
Identifiers: 9939879108331
Academic Unit: King Abdulaziz University
Language: English
Resource Type: Journal article