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

Research output: Contribution to journalJournal articleResearchpeer-review


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 languageEnglish
JournalDiscrete Mathematics
Issue number15
Pages (from-to)1569-1574
Publication statusPublished - 2013


  • Minimal codewords
  • Intersecting codes
  • Matroid theory
  • Cycle code of graphs

Fingerprint Dive into the research topics of 'The maximum number of minimal codewords in an [n, k]-code'. Together they form a unique fingerprint.

Cite this