Skip to Main content Skip to Navigation

Upper Bounds on the Dual Distances of EBCH Codes

Carmen-Simona Nedeloaia 1
1 CODES - Coding and cryptography
Inria Paris-Rocquencourt
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.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 8:47:02 PM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on: : Sunday, April 4, 2010 - 9:24:51 PM


  • HAL Id : inria-00070530, version 1



Carmen-Simona Nedeloaia. Upper Bounds on the Dual Distances of EBCH Codes. [Research Report] RR-5477, INRIA. 2005, pp.14. ⟨inria-00070530⟩



Record views


Files downloads