The maximum number of minimal codewords in an $[n,k]-$code
Information Theory
2012-03-06 v1 Combinatorics
math.IT
Abstract
Upper and lower bounds are derived for the quantity in the title, which is tabulated for modest values of and An application to graphs with many cycles is given.
Keywords
Cite
@article{arxiv.1203.0728,
title = {The maximum number of minimal codewords in an $[n,k]-$code},
author = {A. Alahmadi and R. E. L. Aldred and R. dela Cruz and P. Solé and C. Thomassen},
journal= {arXiv preprint arXiv:1203.0728},
year = {2012}
}
Comments
6 pp. Submitted