HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 11:40:32 AM
Last modification on : Thursday, February 3, 2022 - 11:13:53 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:37:43 PM


  • HAL Id : inria-00073037, version 1



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



Record views


Files downloads