Related papers: On abelian and cyclic group codes

Let $G$ be a nonabelian group. We say that $G$ has an abelian partition, if there exists a partition of $G$ into commuting subsets $A_1, A_2, \ldots, A_n$ of $G$, such that $|A_i|\geqslant 2$ for each $i=1, 2, \ldots, n$. This paper…

We give a lower bound for the exponent of certain elements in the integral cohomology of the total spaces of principal BC-bundles for C a finite cyclic group. As applications we give a proof of the theorem of A. Adem and H.-W. Henn that a…

In this article, we study skew constacyclic codes over a class of finite commutative semisimple rings. The automorphism group of $\mathcal{R}=\prod_{i=1}^t F_q$ is determined, and we characterize skew constacyclic codes over ring by linear…

We classify binary completely regular codes of length $m$ with minimum distance $\delta$ for $(m,\delta)=(12,6)$ and $(11,5)$. We prove that such codes are unique up to equivalence, and in particular, are equivalent to certain Hadamard…

We extend the concepts of antimorphism and antiautomorphism of the additive group of integers modulo $n$, given by Gaitanas Konstantinos, to abelian groups. We give a lower bound for the number of antiautomorphisms of cyclic groups of odd…

We present a family of reducible cyclic codes constructed as the direct sum of two different semiprimitive two-weight irreducible cyclic codes. This family generalizes the class of reducible cyclic codes that was reported in the main result…

A subgroup $H$ of a topological abelian group $X$ is said to be characterized by a sequence $\mathbf v =(v_n)$ of characters of $X$ if $H=\{x\in X:v_n(x)\to 0\ \text{in}\ \mathbb T\}$. We study the basic properties of characterized…

In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…

We study trace codes with defining set $L,$ a subgroup of the multiplicative group of an extension of degree $m$ of the alphabet ring $\mathbb{F}_3+u\mathbb{F}_3+u^{2}\mathbb{F}_{3},$ with $u^{3}=1.$ These codes are abelian, and their…

Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes. In this paper we elaborate on the implication of these parameters and we devise a method to estimate…

In this article, we study the metacyclic p-group codes arising from finite semisimple group algebras. In [CM25], we studied group codes arising from metacyclic groups with order divisible by two distinct odd primes. In the current work, we…

Repeated root Cyclic and Negacyclic codes over Galois rings have been studied much less than their simple root counterparts. This situation is beginning to change. For example, repeated root codes of length $p^s$, where $p$ is the…

We give a combinatorial description (including explicit differential-form bases) for the cohomology groups of the space of n distinct nonzero complex numbers, with coefficients in rank-one local systems which are of finite monodromy around…

The aim of this work is to algebraically describe the relative generalized Hamming weights of evaluation codes. We give a lower bound for these weights in terms of a footprint bound. We prove that this bound can be sharp. We compute the…

The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…

Let $G$ be an additive finite abelian group, and let $\mathrm{disc}(G)$ denote the smallest positive integer $t$ with the property that every sequence $S$ over $G$ with length $|S|\geq t $ contains two nonempty zero-sum subsequences of…

For any simple-root constacyclic code $\mathcal{C}$ over a finite field $\mathbb{F}_q$, as far as we know, the group $\mathcal{G}$ generated by the multiplier, the constacyclic shift and the scalar multiplications is the largest subgroup of…

Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error correction are both essential. They provide an optimal…

In this article we study automorphisms of Toeplitz subshifts. Such groups are abelian and any finitely generated torsion subgroup is finite and cyclic. When the complexity is non superlinear, we prove that the automorphism group is, modulo…

A method to construct and count all the linear codes (of arbitrary length) in $\mathbb{F}_{4}$ that are invariant under reverse permutation and that contain the repetition code is presented. These codes are suitable for constructing DNA…