Note sur la notion d'équivalence entre deux codes linéaires (Q1095866): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An elementary proof of the MacWilliams theorem on equivalence of codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A generalized weight for linear codes and a Witt-MacWilliams theorems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4146667 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4111952 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3050437 / rank | |||
Normal rank |
Latest revision as of 13:42, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Note sur la notion d'équivalence entre deux codes linéaires |
scientific article |
Statements
Note sur la notion d'équivalence entre deux codes linéaires (English)
0 references
1987
0 references
In this paper it is shown that the existence of a Hamming isometry sending a code C onto a code C' implies the existence of a Hamming isometry sending C onto C' whose restrictions to the simple components of C are semilinear. (A code is called simple if it is not the direct sum of two or more smaller codes having disjoint supports, the support of a code is the union of the supports of its elementary words (which are the words x in C such that there does not exist a word x' in C with supp(x') contained in supp(x)).) In the case where C is a subspace of \({\mathbb{F}}^ n\), where \({\mathbb{F}}\) is of prime order, it has been proved that such a Hamming isometry is linear. The paper is well written and I think the results are nice. However example (3) on page 181 is incorrect: The code \(C={\mathbb{F}}^ 2_ 2\) is cyclic but not simple since \(C=<(1\quad 0)>\oplus <(0\quad 1)>.\)
0 references
equivalence
0 references
automorphisms
0 references
Hamming isometry
0 references