Permutation decoding of Z 2 Z 4 - linear codes
نویسندگان
چکیده
An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codes such as Z2Z4-linear codes, which are binary and, in general, nonlinear codes in the usual sense. For this, it is proved that these codes allow a systematic encoding scheme. As particular examples, this permutation decoding method is applied to some Hadamard Z2Z4-linear codes.
منابع مشابه
On the permutation decoding for binary linear and Z4-linear Hadamard codes
Permutation decoding is a technique, introduced in [3] by MacWilliams, that strongly depends on the existence of special subsets, called PD-sets, of the permutation automorphism group PAut(C) of a linear code C. In [2], it is shown how to find s-PD-sets of minimum size s + 1 for partial permutation decoding for the binary simplex code Sm of length 2 − 1, for all m ≥ 4 and 1 < s ≤ ⌊ 2−m−1 m ⌋ . ...
متن کاملTranslation-invariant propelinear codes
A class of binary group codes is investigated. These codes are the propelinear codes, deened over the Hamming metric space F n , F = f0; 1g, with a group structure. Generally, they are neither abelian nor translation invariant codes but they have good algebraic and com-binatorial properties. Linear codes and Z 4-linear codes can be seen as a subclass of prope-linear codes. Exactly, it is shown ...
متن کاملPartial permutation decoding for binary linear and Z4-linear Hadamard codes
Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permutation automorphism group of a code C in order to assist in decoding. A method to obtain s-PD-sets of minimum size s + 1 for partial permutation decoding for binary linear Hadamard codes Hm of length 2 , for all m ≥ 4 and 1 < s ≤ ⌊ 2−m−1 1+m ⌋ , is described. Moreover, a recursive construction to o...
متن کاملPartial permutation decoding for binary linear Hadamard codes
Permutation decoding is a technique which involves finding a subset S, called PDset, of the permutation automorphism group PAut(C) of a code C in order to assist in decoding. A method to obtain s-PD-sets of size s + 1 for partial permutation decoding for the binary linear Hadamard codes Hm of length 2 m, for all m ≥ 4 and 1 < s ≤ b(2m −m− 1)/(1 + m)c, is described. Moreover, a recursive constru...
متن کاملPermutation decoding of ℤ2ℤ4-linear codes
An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codes such as Z2Z4-linear codes, which are binary and, in general, nonlinear codes in the usual sense. For this, it is proved that these codes allow a systematic encoding scheme. As a ...
متن کامل