The Support Splitting Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1999

The Support Splitting Algorithm

Nicolas Sendrier

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3637.pdf (356.82 Ko) Télécharger le fichier

Dates and versions

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

Identifiers

  • HAL Id : inria-00073037 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More