An upper bound is derived on the dual distance of BCH binary codes. This yields an upper bound on the dual distance of the codes B(d, m). It also improves some lower bounds for complete rational trigonometric sums in fields of characteristic 2.
|Number of pages||6|
|Journal||Problems of Information Transmission|
|State||Published - Oct 1986|