A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to Primitive Narrow-Sense BCH Codes of Length~511 - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1995

A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to Primitive Narrow-Sense BCH Codes of Length~511

Anne Canteaut
Florent Chabaud
  • Function : Author

Abstract

An algorithm for finding small-weight words in large linear codes is developed. It is in particular able to decode random [512,256,57]-linear codes in 9~hours on a DEC alpha computer. We determine with it the minimum distance of some binary BCH codes of length~511, which were not known.
Fichier principal
Vignette du fichier
RR-2685.pdf (336.32 Ko) Télécharger le fichier

Dates and versions

inria-00074006 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074006 , version 1

Cite

Anne Canteaut, Florent Chabaud. A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to Primitive Narrow-Sense BCH Codes of Length~511. [Research Report] RR-2685, INRIA. 1995. ⟨inria-00074006⟩
233 View
342 Download

Share

Gmail Facebook Twitter LinkedIn More