Title of article :
The maximum number of minimal codewords in an -code
Author/Authors :
Alahmadi، نويسنده , , A. and Aldred، نويسنده , , R.E.L. and de la Cruz، نويسنده , , R. and Solé، نويسنده , , P. and Thomassen، نويسنده , , C.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2013
Pages :
6
From page :
1569
To page :
1574
Abstract :
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 .
Keywords :
Minimal codewords , Intersecting codes , Cycle code of graphs , Matroid theory
Journal title :
Discrete Mathematics
Serial Year :
2013
Journal title :
Discrete Mathematics
Record number :
1600368
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=1600368
بازگشت