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

A. Alahmadi; C. Thomassen; P. Sol\'e; R. dela Cruz; R. E. L. Aldred

arxiv: 1203.0728 · v1 · pith:ZZPR3R5Fnew · submitted 2012-03-04 · 💻 cs.IT · math.CO· math.IT

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

A. Alahmadi , R. E. L. Aldred , R. dela Cruz , P. Sol\'e , C. Thomassen This is my paper

classification 💻 cs.IT math.COmath.IT

keywords applicationboundscodecodewordscyclesderivedgivengraphs

0 comments

read the original abstract

Upper and lower bounds are derived for the quantity in the title, which is tabulated for modest values of $n$ and $k.$ An application to graphs with many cycles is given.

This paper has not been read by Pith yet.

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

discussion (0)