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.
Type de document :
Rapport
[Research Report] RR-2685, INRIA. 1995
Liste complète des métadonnées

https://hal.inria.fr/inria-00074006
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:16:51
Dernière modification le : samedi 17 septembre 2016 - 01:35:40
Document(s) archivé(s) le : jeudi 24 mars 2011 - 13:48:05

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

231

Téléchargements de fichiers

306