On the covering radius of long 5-ary BCH codes with minimum distance 7 (Q1360993)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1038361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the covering radius of long 5-ary BCH codes with minimum distance 7 |
scientific article; zbMATH DE number 1038361 |
Statements
On the covering radius of long 5-ary BCH codes with minimum distance 7 (English)
0 references
12 May 1998
0 references
The authors study S. D. Cohen's method of estimating the covering radius of long primitive non-binary BCH codes defined over a prime field. As an application the authors show that the covering radius is asymptotically at most 7 for 5-ary BCH codes with minimum distance 7.
0 references
covering radius
0 references
long primitive non-binary BCH codes
0 references
0.8363610506057739
0 references
0.8295875787734985
0 references
