Related papers: Construction of minimal non-abelian left group cod…
Let $G$ be a finite non-abelian group and $\kappa_1(G)$ the number of conjugate classes of minimal non-abelian subgroups of $G$. The structure of $G$ with $\kappa_1(G)=1$ is determined. In the case of $G$ being the $p$-groups, the structure…
We present a development in the computational suite for the study of $N_\infty$ operads for a finite group $G$. This progress is achieved using the simple yet powerful observation that Rubin's generation algorithm can be interpreted as a…
A definition of atomic codeword for a group code is presented. Some properties of atomic codewords of group codes are investigated. Using these properties, it is shown that every minimal tail-biting trellis for a group code over a finite…
In this paper, we will give the generic construction of a binary linear code of dimension $n+3$ and derive the necessary and sufficient conditions for the constructed code to be minimal. Using generic construction, a new family of minimal…
Based on results in finite geometry we prove the existence of MRD codes in (F_q)_(n,n) with minimum distance n which are essentially different from Gabidulin codes. The construction results from algebraic structures which are closely…
A classical result of topological algebra states that any compact left topological semigroup has an idempotent. We refine this by showing that any compact left topological left semiring has a common, i.e. additive and multiplicative…
Group algebras have been used in the context of Coding Theory since the beginning of the latter, but not in its full power. The work of Ferraz and Polcino Milies entitled Idempotents in group algebras and minimal abelian codes (Finite…
Recently, constructions of optimal linear codes from simplicial complexes have attracted much attention and some related nice works were presented. Let $q$ be a prime power. In this paper, by using the simplicial complexes of ${\mathbb…
We provide a detailed structural description of the nilpotent primitive subgroups of $\mathrm{GL}(n, \mathbb{F})$, where $\mathbb{F}$ is a finite field.
Recently, minimal linear codes have been extensively studied due to their applications in secret sharing schemes, secure two-party computations, and so on. Constructing minimal linear codes violating the Ashikhmin-Barg condition and then…
Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…
The aim of this paper is to study quasitriangular structures on a class of semisimple Hopf algebras constructed through abelian extensions of $Z_2$ for an abelian group $G$. We prove that there are only two forms of them. Using such…
In the realm of algebraic geometric (AG) codes, characterizing dual codes has long been a challenging task. In this paper we introduces a generalized criterion to characterize self-orthogonality of AG codes based on residues, drawing upon…
Necessary and sufficient conditions for finite commutative semihypergroups to be built from abelian groups of the same order are established.
Minimal linear codes are algebraic objects which gained interest in the last twenty years, due to their link with Massey's secret sharing schemes. In this context, Ashikhmin and Barg provided a useful and a quite easy to handle sufficient…
We give a description of elementary subgroups (in the sense of first-order logic) of finitely generated virtually free groups. In particular, we recover the fact that elementary subgroups of finitely generated free groups are free factors.…
Given a group $X$ we study the algebraic structure of the compact right-topological semigroup $\lambda(X)$ consisting of maximal linked systems on $X$. This semigroup contains the semigroup $\beta(X)$ of ultrafilters as a closed…
We present new constructions of binary quantum codes from quaternary linear Hermitian self-dual codes. Our main ingredients for these constructions are nearly self-orthogonal cyclic or duadic codes over F_4. An infinite family of…
Let $F$ be an arbitrary field and let $f:V\times V\to F$ be a non-degenerate symmetric or alternating bilinear form defined on an $F$-vector space of finite dimension $m\geq 2$. Let $L(f)$ be the subalgebra of $gl(V)$ formed by all…
In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…