The Support Splitting Algorithm

Nicolas Sendrier 1
1 CODES - Coding and cryptography
Inria Paris-Rocquencourt
Abstract : Two linear codes are permutation-equivalent if they are equal up to a fixed permutation of the codewords coordinates. We present here an algorithm able to compute this permutation. We introduce the concept of signature: a property of a position of a code such that the set of all signatures of a given code is globally invariant by permutation. To compute the permutati- on between two equivalent codes, one needs a signature which is both discrimin- ant and easy to compute. The weight enumerator of the hull of a code provides a signature which has such properties in most cases.
Type de document :
Rapport
[Research Report] RR-3637, INRIA. 1999
Liste complète des métadonnées

https://hal.inria.fr/inria-00073037
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 11:40:32
Dernière modification le : mardi 17 avril 2018 - 11:25:14
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:37:43

Fichiers

Identifiants

  • HAL Id : inria-00073037, version 1

Collections

Citation

Nicolas Sendrier. The Support Splitting Algorithm. [Research Report] RR-3637, INRIA. 1999. 〈inria-00073037〉

Partager

Métriques

Consultations de la notice

176

Téléchargements de fichiers

769