|
Search: id:A060451
|
|
|
| A060451 |
|
Triangle T(m,R) (1 <= R <= m) giving shortest possible length n of an [n,n-m] binary linear code with covering radius R. |
|
+0
2
|
|
| 1, 3, 2, 7, 4, 3, 15, 5, 5, 4, 31, 9, 6, 6, 5, 63, 13, 7, 7, 7, 6, 127, 19, 11, 8, 8, 8, 7, 255
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
G. D. Cohen et al., Covering Codes, North-Holland, 1997, p. 202.
|
|
LINKS
|
Index entries for sequences related to covering codes
|
|
EXAMPLE
|
1; 3,2; 7,4,3; 15,5,5,4; 31,9,6,6,5; ...
|
|
CROSSREFS
|
Cf. A060450.
Sequence in context: A075270 A067872 A011772 this_sequence A129187 A166532 A135542
Adjacent sequences: A060448 A060449 A060450 this_sequence A060452 A060453 A060454
|
|
KEYWORD
|
nonn,tabl,nice,hard
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Apr 08 2001
|
|
EXTENSIONS
|
The next entry, T(8,2), is 25 or 26.
|
|
|
Search completed in 0.002 seconds
|
