Lower bounds for \(q\)-ary coverings by spheres of radius one (Q1331134): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0097-3165(94)90013-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992996954 / rank | |||
Normal rank | |||
Revision as of 02:31, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for \(q\)-ary coverings by spheres of radius one |
scientific article |
Statements
Lower bounds for \(q\)-ary coverings by spheres of radius one (English)
0 references
9 August 1994
0 references
Let \(C\) be a \(q\)-ary covering code with covering radius one. The author shows that if \((q - 1)n + 1\) does not divide \(q^ n\) and if \((q,n) \notin \{(2,2), (2,4)\}\), the sphere covering bound is not reached. The author characterizes the cases where the sphere covering bound is attained, when \(q\) is a prime power. The author also presents some improvements of lower bounds for binary and ternary codes.
0 references
binary codes
0 references
\(q\)-ary covering code
0 references
covering radius one
0 references
sphere covering bound
0 references
lower bounds
0 references
ternary codes
0 references
