Upper Bounds on the Dual Distances of EBCH Codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2005

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.
Fichier principal
Vignette du fichier
RR-5477.pdf (237.81 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00070530 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070530 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More