|
| |
|
|
A102482
|
|
Table read by rows: T(n,k) = highest minimal weight of linear code of length n over GF(4) containing 4^k words (n >= 1, 1 <= k <= n).
|
|
1
| |
|
|
1, 2, 1, 3, 2, 1, 4, 3, 2, 1, 5, 4, 3, 2, 1, 6, 4, 4, 2, 2, 1, 7, 5, 4, 3, 2, 2, 1, 8, 6, 5, 4, 3, 2, 2, 1, 9, 7, 6, 5, 4, 3, 2, 2, 1, 10, 8, 6, 6, 5, 4, 3, 2, 2, 1, 11, 8, 7, 6, 6, 5, 4, 3, 2, 2, 1, 12, 9, 8, 7, 6, 6, 4, 4, 3, 2, 2, 1
(list; table; graph; refs; listen; history; internal format)
|
| |
| |
|
|
