Abstract
An upper bound is derived on the number of information symbols of arbitrary q-ary BCH codes with a given constructive distance d and length n. A similar result has been previously available only for codes of length n = qm - 1, m = 1,2,...
| Original language | English |
|---|---|
| Pages (from-to) | 77-80 |
| Number of pages | 4 |
| Journal | Problems of information transmission |
| Volume | 25 |
| Issue number | 1 |
| Publication status | Published - Jan 1989 |