DeepAI AI Chat
Log In Sign Up

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

by   Fatma Altunbulak Aksu, et al.

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.


page 1

page 2

page 3

page 4


Involutory permutation automorphisms of binary linear codes

We investigate the properties of binary linear codes of even length whos...

The Projective General Linear Group PGL_2(GF(2^m)) and Linear Codes of Length 2^m+1

The projective general linear group PGL_2(GF(2^m)) acts as a 3-transitiv...

Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes

It was shown in GXY18 that the length n of a q-ary linear locally recove...

Optimal Constant-Weight Codes under l_1-Metric

Motivated by the duplication-correcting problem for data storage in live...

Minimizing costs of communication with random constant weight codes

We present a framework for minimizing costs in constant weight codes whi...

A characterization of abelian group codes in terms of their parameters

In 1979, Miller proved that for a group G of odd order, two minimal grou...

On Constant-Weight Binary B_2-Sequences

Motivated by applications in polymer-based data storage we introduced th...