A209334 Table, by rows, of the maximum number of minimal codewords in an [n,k]-code.

1, 1, 2, 1, 3, 3, 1, 3, 6, 4, 1, 3, 6, 10, 5, 1, 3, 7, 11, 15, 6, 1, 3, 7, 14, 17, 21, 7, 1, 3, 7, 14, 22, 25, 28, 8, 1, 3, 7, 15, 26, 33, 36, 36, 9, 1, 3, 7, 15, 30, 42, 48, 48, 45, 10, 1, 3, 7, 15, 30, 52, 66, 69, 63, 55, 11, 1, 3, 7, 15, 30, 54, 90, 103, 95, 82, 66, 12

Offset

1,3

Links

Michel Marcus, Table of n, a(n) for n = 1..120 (rows 1..15)

A. Alahmadi, R. E. L. Aldred, R. dela Cruz, P. Solé, C. Thomassen, The maximum number of minimal codewords in an [n,k]-code, arXiv:1203.0728v1 [cs.IT], Mar 4, 2012.

Romar dela Cruz and Sascha Kurz, On the maximum number of minimal codewords, arXiv:2010.10762 [cs.IT], 2020. See Table 1 p. 12.

N. J. A. Sloane, Covering Arrays and Intersecting Codes, J. Combinatorial Designs, 1 (1993), 51-63.

Example

Triangle begins:
  1
  1 2
  1 3 3
  1 3 6 4
  1 3 6 10 5
  1 3 7 11 15 6
  1 3 7 14 17 21 7
  1 3 7 14 22 25 28 8
  1 3 7 15 26 33 36 36 9

Crossrefs

Sequence in context: A234951 A291302 A278493 * A180975 A210216 A195915

Adjacent sequences: A209331 A209332 A209333 * A209335 A209336 A209337

Keyword

nonn,tabl

Author

Jonathan Vos Post, Mar 06 2012

Extensions

Rows 1 and 2 inserted, and more rows added by Michel Marcus, Oct 23 2020 from dela Cruz and Kurz article

Status

approved