On the minimum number of minimal codewords
Combinatorics
2023-01-19 v1
Abstract
We study the minimum number of minimal codewords in linear codes from the point of view of projective geometry. We derive bounds and in some cases determine the exact values. We also present an extension to minimal subcode supports.
Keywords
Cite
@article{arxiv.1912.09804,
title = {On the minimum number of minimal codewords},
author = {Romar dela Cruz and Michael Kiermaier and Sascha Kurz and Alfred Wassermann},
journal= {arXiv preprint arXiv:1912.09804},
year = {2023}
}
Comments
8 pages, 1 table