|
|||||
|
|
The Length of Primitive BCH Codes with Minimal Covering Radius |
|
| Authors: | Stephen D Cohen |
| Abstract: | It is proved that the covering radius of a primitive binary BCH code of length q-1 and designed distance 2t+1, where is exactly 2t-1 (the minimum value possible). The bound for q is significantly lower than the one obtained by O. Moreno and C. J. Moreno 9]. |
| Keywords: | BCH codes covering radius |
| 本文献已被 SpringerLink 等数据库收录！ | |