On the covering radius of long binary BCH codes (Q1093616): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1199638 |
Changed an Item |
||
| Property / author | |||
| Property / author: Aimo Tietäväinen / rank | |||
Normal rank | |||
Revision as of 13:08, 22 February 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
