The minimum number of minimal codewords in an [n, k]-code and in graphic codes

Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, S. Ok, Patrick Solé, Carsten Thomassen. The minimum number of minimal codewords in an [n, k]-code and in graphic codes. Discrete Applied Mathematics, 184:32-39, 2015. [doi]

@article{AlahmadiACOST15,
  title = {The minimum number of minimal codewords in an [n, k]-code and in graphic codes},
  author = {Adel Alahmadi and Robert E. L. Aldred and Romar dela Cruz and S. Ok and Patrick Solé and Carsten Thomassen},
  year = {2015},
  doi = {10.1016/j.dam.2014.11.015},
  url = {http://dx.doi.org/10.1016/j.dam.2014.11.015},
  researchr = {https://researchr.org/publication/AlahmadiACOST15},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {184},
  pages = {32-39},
}