Construction of binary linear constant weight codes by symmetric differences of supports

08/22/2022

∙

by   Fatma Altunbulak Aksu, et al.

∙

0

∙

share

We give a construction for the binary linear constant weight codes by using the symmetric differences of the supports of the codewords. Moreover, we give a characterization for the constant weight codes with given parameters in terms of supports of the codewords. We also prove that the constant weight codes with the same parameters (length, dimension, weight) are permutation equivalent. Lastly, we prove that the order of the permutation automorphism group of a given constant weight code of the dimension ≥ 2 is a multiple of six.