On the covering radius of long binary BCH codes (Q1093616): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Bounds for exponential sums / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the covering radius of cyclic linear codes and arithmetic codes / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(87)90055-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2249337672 / rank | |||
Normal rank | |||
Latest revision as of 10:26, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the covering radius of long binary BCH codes |
scientific article |
Statements
On the covering radius of long binary BCH codes (English)
0 references
1987
0 references
The author has proved in this paper that the covering radius of long binary BCH codes with designed distance \(2t+1\) is at most 2t.
0 references
covering radius
0 references
long binary BCH codes
0 references
