Skip to Main content Skip to Navigation
Reports

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

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00074006
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:16:51 PM
Last modification on : Wednesday, February 17, 2021 - 10:26:08 AM
Long-term archiving on: : Thursday, March 24, 2011 - 1:48:05 PM

Identifiers

  • HAL Id : inria-00074006, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

339

Files downloads

1407