Upper Bounds on the Dual Distances of EBCH Codes
Abstract
We give new upper bounds on the dual distances of extended BCH codes of length 512. First, we apply a probabilistic algorithm due to Canteaut and Chabaud. Secondly, we put these codes in standard bit order and we use the twisted squaring decomposition of affine-invariant codes. We then obtain two subcodes which contain codewords of minimum weights for the duals of BCH codes of length less than or equal to 512. This decomposition also gives new interesting codes of smaller length, which sometimes are found to be Reed-Muller codes.
Loading...