Related papers: On a class of left metacyclic codes
A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…
For prime $p$, $GR(p^a,m)$ represents the Galois ring of order $p^{am}$ and characterise $p$, where $a$ is any positive integer. In this article, we study the Type (1) $\lambda$-constacyclic codes of length $4p^s$ over the ring $GR(p^a,m)$,…
Let $\mathbb {F}_q$ be a finite field and $G$ a finte group with $(|G|,q)=1$. By a group code in $\mathbb {F}_q[G]$ we mean a two-sided ideal in $\mathbb {F}_q[G]$. We will prove a general criterion for the existence of group codes with…
After a discussion of the Griesmer and Heller bound for the distance of a convolutional code we present several codes with various parameters, over various fields, and meeting the given distance bounds. Moreover, the Griesmer bound is used…
Let $G$ be a finite group and $H$ a subgroup of $G$. Each left transversal (with identity) of $H$ in $G$ has a left loop (left quasigroup with identity) structure induced by the binary operation of $G$. We say two left transversals are…
Infinitely many large Schur sigma-groups G with non-elementary bicyclic commutator quotient G/G' = C(3^e) x C(3), e >= 2, are constructed as periodic sequences of vertices in descendant trees of finite 3-groups. A single root gives rise to…
Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Cyclic codes have been studied for many years, but their weight…
Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…
In this paper, we construct a large family of projective linear codes over ${\mathbb F}_{q}$ from the general simplicial complexes of ${\mathbb F}_{q}^m$ via the defining-set construction, which generalizes the results of [IEEE Trans. Inf.…
Cyclic BCH codes and negacyclic BCH codes form important subclasses of cyclic codes and negacyclic codes, respectively, and can produce optimal linear codes in many cases. To the best of our knowledge, there are few results on the dual…
In this paper, we study the structure of cyclic, quasi-cyclic, constacyclic codes and their skew codes over the finite ring R=Z_3+vZ_3+v^2Z_3, v^3=v. The Gray images of cyclic, quasi-cyclic, skew cyclic, skew quasi-cyclic and skew…
In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=\mathbb{F}_2+v\mathbb{F}_2+v^2\mathbb{F}_2$, where $v^3=1.$ These codes are defined as trace codes. They have the algebraic…
We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…
By using the notion of $d$-embedding $\Gamma$ of a (canonical) subgeometry $\Sigma$ and of exterior set with respect to the $h$-secant variety $\Omega_{h}(\mathcal{A})$ of a subset $\mathcal{A}$, $ 0 \leq h \leq n-1$, in the finite…
Based on good algebraic structures and practicabilities, generalized quasi-cyclic (GQC) codes play important role in coding theory. In this paper, we study some results on GQC codes over $\mathbb{Z}_4$ including the normalized generating…
Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $\lambda$ and $k$ be integers satisfying $\lambda,k\geq 2$ and denote $R=\mathbb{F}_{2^m}[u]/\langle u^{2\lambda}\rangle$. Let $\delta,\alpha\in \mathbb{F}_{2^m}^{\times}$. For…
Suppose that $G$ is a groupoid with binary operation $\otimes$. The pair $(G,\otimes)$ is said to be a gyrogroup if the operation $\otimes$ has a left identity, each element $a \in G$ has a left inverse and the gyroassociative law and the…
Coding theory and combinatorial $t$-designs have close connections and interesting interplay. One of the major approaches to the construction of combinatorial t-designs is the employment of error-correcting codes. As we all known, some…
The paper presents a comprehensive study of group codes from non-abelian split metacyclic group algebras. We derive an explicit Wedderburn-like decomposition of finite split metacyclic group algebras over fields with characteristic coprime…
Let $R$ be a ring, $\CC_R$ and $\pCCR$ be the set of regular and left regular elements of $R$ ($\CC_R\subseteq \pCCR$). Goldie's Theorem is a semisimplicity criterion for the classical left quotient ring $Q_{l,cl}(R):=\CC_R^{-1}R$.…