Weight of duals of BCH codes and exponential sums

https://doi.org/10.1016/S1071-5797(02)00016-3Get rights and content
Under an Elsevier user license
open archive

Abstract

We consider a binary BCH code Cm of length 2m–1. If m is odd, we improve the bound on the distance of the dual of Cm previously given by Carlitz–Uchiyama, Serre and Moreno–Moreno.

Cited by (0)