Nonbinary random error-correcting codes (Corresp.)
Jack K. Wolf · IEEE Transactions on Information Theory · 1970
Primitive BCH codes with symbols fromGF(q)and designed distancedhave parameter values \begin{align} \text{block length} &= n = q^m - 1 \\ \text{check symbols/block} &= r \leq m(d - 1) \end{align} wheremis any positive integer. For many nonbinary BCH codes (called maximally redundant codes), the maximum number of check symbols per block is required, i.e.r = m(d - 1). Conditions whereby a primitive nonbinary BCH code is maximally redundant are discussed. It is shown that a class of codes exists, with symbols fromGF(q), based upon doubly lengthened Reed-Solomon codes overGF(q^m), having parameter values \begin{align} \text{block length} &= n = m(q^m + 1) \\ \text{check symbols/block} &= r = m(d - 1) \\ \text{designed distance} &= d \end{align} where againmis any positive integer. Thus this class of codes extends the block length of maximally redundant codes by a multiplicative factor exceedingm, while retaining the same designed distance and same number of check symbols.