Binary and ternary codes of covering radius one: some new lower bounds (Q1849922)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Binary and ternary codes of covering radius one: some new lower bounds |
scientific article |
Statements
Binary and ternary codes of covering radius one: some new lower bounds (English)
0 references
2 December 2002
0 references
The aim of this paper is to generalize the method developed by the author in an earlier paper in the cases \(q=2\) and \(q=3\) which provide new lower obunds for \(k_2(n)\) and \(k_3(n)\), where \(k_q(n)\) denotes the minimal cardinality of a \(q\)-ary code \(C\) of length \(n\) and covering radius one. Section 3 of the paper is devoted to the binary case with improvements on already known lower bounds for \(k_2(n)\) in the cases \(n= 19,21,25,27\) and \(33\). Section 4 contains the ternary case (known as the football pool problem) with new lower bounds for \(k_3(8)\) and \(k_3(10)\).
0 references
ternary codes
0 references
binary codes
0 references
lienar inequalities
0 references
covering radius one
0 references
lower bounds
0 references
football pool problem
0 references