On the binary linear constant weight codes and their autormorphism groups

Murat Altunbulak; Fatma Altunbulak Aksu

Home/Archive/arXiv

arXiv · 2208.10267

On the binary linear constant weight codes and their autormorphism groups

Murat Altunbulak·Fatma Altunbulak Aksu

View original source ↗Read source document ↗Export metadata ↓

Abstract

We give a characterization for the binary linear constant weight codes by using the symmetric difference of the supports of the codewords. This characterization gives a correspondence between the set of binary linear constant weight codes and the set of partitions for the union of supports of the codewords. By using this correspondence, we present a formula for the order of the automorphism group of a binary linear constant weight code in terms of its parameters. This formula is a key step to determine more algebraic structures on constant weight codes with given parameters. Bonisoli [Bonisoli, A.: Every equidistant linear code is a sequence of dual Hamming codes. Ars Combinatoria 18, 181--186 (1984)] proves that the $q$-ary linear constant weight codes with the same parameters are equivalent (for the binary case permutation equivalent). We also give an alternative proof for Bonisoli's theorem by presenting an explicit permutation on symmetric difference of the supports of the codewords which gives the permutation equivalence between the binary linear constant weight codes.

Explore related subjects

cs.IT math.CO math.IT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Murat Altunbulak, Fatma Altunbulak Aksu. 2023-04-10. On the binary linear constant weight codes and their autormorphism groups. https://arxiv.org/abs/2208.10267

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT↗

arXiv2026

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT↗

arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗