[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A209334 (Underlined text is an addition; strikethrough text is a deletion.)

newer changes | Showing entries 11-20 | older changes
A209334 Table, by rows, of the maximum number of minimal codewords in an [n,k]-code.
(history; published version)
#15 by Alois P. Heinz at Fri Oct 23 11:20:12 EDT 2020
DATA

1, 3, 3, 1, 3, 6, 4, 1, 3, 6, 10, 5, 1, 3, 7, 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

STATUS

approved

editing

#14 by Alois P. Heinz at Fri Oct 23 11:19:39 EDT 2020
STATUS

proposed

approved

#13 by Michel Marcus at Fri Oct 23 04:40:19 EDT 2020
STATUS

editing

proposed

Discussion
Fri Oct 23 11:19
Alois P. Heinz: thanks ...
#12 by Michel Marcus at Fri Oct 23 04:39:32 EDT 2020
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

Discussion
Fri Oct 23 04:40
Michel Marcus: If accepted, I will add a b-file with 15 rows (see arxiv)
#11 by Michel Marcus at Fri Oct 23 04:38:54 EDT 2020
DATA

1, 3, 3, 1, 3, 6, 4, 1, 3, 6, 10, 5, 1, 3, 7, 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

EXAMPLE

Table 2, p. 5, M(n, k) for 3 <= n <= 15 and k <= 13 begins:

=================================================

n/k...|.k=1.|.k=2.|.k=3.|.k=4.|.k=5.|.k=6.|.k=7.|

n=3...|..1..|..3..|..3..|.....|.....|.....|.....|

n=4...|..1..|..3..|..6..|..4..|.....|.....|.....|

n=5...|..1..|..3..|..6..|.10..|..5..|.....|.....|

n=6...|..1..|..3..|..7..|11-14|.15..|..6..|.....|

n=7...|..1..|..3..|..7..|.14..|17-30|.21..|..7..|

=================================================

KEYWORD

nonn,tabl,more,changed

EXTENSIONS

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

STATUS

approved

editing

#10 by N. J. A. Sloane at Fri Oct 23 02:46:35 EDT 2020
STATUS

proposed

approved

#9 by Michel Marcus at Wed Oct 21 23:24:34 EDT 2020
STATUS

editing

proposed

#8 by Michel Marcus at Wed Oct 21 23:21:27 EDT 2020
COMMENTS

Table 2, p. 5, M(n, k) for 3 <= n <= 15 and k <= 13 begins:

=================================================

n/k...|.k=1.|.k=2.|.k=3.|.k=4.|.k=5.|.k=6.|.k=7.|

n=3...|..1..|..3..|..3..|.....|.....|.....|.....|

n=4...|..1..|..3..|..6..|..4..|.....|.....|.....|

n=5...|..1..|..3..|..6..|.10..|..5..|.....|.....|

n=6...|..1..|..3..|..7..|11-14|.15..|..6..|.....|

n=7...|..1..|..3..|..7..|.14..|17-30|.21..|..7..|

=================================================

REFERENCES

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

LINKS

Romar dela Cruz and Sascha Kurz, <a href="https://arxiv.org/abs/2010.10762">On the maximum number of minimal codewords</a>, arXiv:2010.10762 [cs.IT], 2020. See Table 1 p. 12.

N. J. A. Sloane, <a href="http://neilsloane.com/doc/Me179.pdf">Covering Arrays and Intersecting Codes</a>, J. Combinatorial Designs, 1 (1993), 51-63.

EXAMPLE

Table 2, p. 5, M(n, k) for 3 <= n <= 15 and k <= 13 begins:

=================================================

n/k...|.k=1.|.k=2.|.k=3.|.k=4.|.k=5.|.k=6.|.k=7.|

n=3...|..1..|..3..|..3..|.....|.....|.....|.....|

n=4...|..1..|..3..|..6..|..4..|.....|.....|.....|

n=5...|..1..|..3..|..6..|.10..|..5..|.....|.....|

n=6...|..1..|..3..|..7..|11-14|.15..|..6..|.....|

n=7...|..1..|..3..|..7..|.14..|17-30|.21..|..7..|

=================================================

KEYWORD

nonn,tabl,more

STATUS

approved

editing

Discussion
Wed Oct 21 23:22
Michel Marcus: is this the right sequence for arXiv:2010.10762 ?
23:23
Michel Marcus: row n=1 & 2 are currently missing here
23:24
Michel Marcus: ok to use Cruz and Kurz table to enter data here ?
#7 by Jon E. Schoenfield at Tue Feb 11 07:50:55 EST 2020
STATUS

editing

approved

#6 by Jon E. Schoenfield at Tue Feb 11 07:50:46 EST 2020
COMMENTS

Table 2, p.. 5, M(n, k) for 3 <= n <= 15 and k <= 13 begins:

LINKS

A. Alahmadi, R. E. L. Aldred, R. dela Cruz, P. Solé, C. Thomassen, <a href="http://arxiv.org/abs/1203.0728">The maximum number of minimal codewords in an [n,k]-code</a>, arXiv:1203.0728v1 [cs.IT], Mar 4, 2012.

STATUS

approved

editing

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 09:09 EDT 2024. Contains 375511 sequences. (Running on oeis4.)