Related papers: Linear complementary pair of group codes over fini…
A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…
Let $R$ be a finite commutative chain ring with unique maximal ideal $\langle \gamma\rangle$, and let $n$ be a positive integer coprime with the characteristic of $R/\langle \gamma\rangle$. In this paper, the algebraic structure of cyclic…
We determine the permutation groups $P_{\mathrm{comp}}(\mathbb{F}_q),P_{\mathrm{orth}}(\mathbb{F}_q)\leq\operatorname{Sym}(\mathbb{F}_q)$ generated by the complete mappings, respectively the orthomorphisms, of the finite field…
Given an integral domain $D$ and a $D$-algebra $R$, we introduce the local Picard group $\mathrm{LPic}(R,D)$ as the quotient between the Picard group $\mathrm{Pic}(R)$ and the canonical image of $\mathrm{Pic}(D)$ in $\mathrm{Pic}(R)$, and…
A linear system is a pair $(P,\mathcal{L})$ where $\mathcal{L}$ is a family of subsets on a ground finite set $P$ such that $|l\cap l^\prime|\leq 1$, for every $l,l^\prime \in \mathcal{L}$. The elements of $P$ and $\mathcal{L}$ are called…
Let $R$ be a finite unital commutative ring. We introduce a new class of finite groups, which we call hereditary groups over $R$. Our main result states that if $G$ is a hereditary group over $R$ then a unital algebra isomorphism between…
We show there is an uncountable number of parallel total perfect codes in the integer lattice graph ${\Lambda}$ of $\R^2$. In contrast, there is just one 1-perfect code in ${\Lambda}$ and one total perfect code in ${\Lambda}$ restricting to…
We will prove that if $G$ and $H$ are modules over a principal ideal domain $R$ such that the endomorphism rings $\mathrm{End}_R(R\oplus G)$ and $\mathrm{End}_R(R\oplus H)$ are isomorphic then $G\cong H$. Conversely, if $R$ is a Dedekind…
A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…
In this paper, we first introduce the notion of generalized pair weights of an $[n, k]$-linear code over the finite field $\mathbb{F}_q$ and the notion of pair $r$-equiweight codes, where $1\le r\le k-1$. Some basic properties of…
A subset $C$ of the vertex set $V$ of a graph $\Gamma$ is called a perfect code in $\Gamma$ if every vertex in $V\setminus C$ is adjacent to exactly one vertex in $C$. Given a group $G$ and a subgroup $H$ of $G$, a subgroup $A$ of $G$…
For any extension of commutative rings $A\subseteq B$, by using invertible ideals, we first define an Abelian group $\Cl(A,B)$, that we call the ideal class group of this extension. Then we study the main properties of this group. Among…
Let $\mathtt{R}$ be a finite commutative chain ring with the maximal ideal $\gamma\mathtt{R}$ of nilpotency index $e\geq 2,$ and let $\check{\mathtt{R}}=\mathtt{R}/\gamma^{s}\mathtt{R}$ for some positive integer $ s< e.$ In this paper, we…
In this paper, a recent method to construct complementary sequence sets and complete complementary codes by Hadamard matrices is deeply studied. By taking the algebraic structure of Hadamard matrices into consideration, our main result…
Linear code with complementary dual($LCD$) are those codes which meet their duals trivially. In this paper we will give rather alternative proof of Massey's theorem\cite{Massey2}, which is one of the most important characterization of $LCD$…
A graph $G$ is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree $T$ and two non-negative real numbers $d_{min}$ and $d_{max}$ such that each leaf $l_u$ of $T$ corresponds to a vertex $u \in V$ and there is…
Let $R$ be a ring with $1$ and $\J(R)$ its Jacobson radical. Then $1+\J(R)$ is a normal subgroup of the group of units, $G(R)$. The existence of a complement to this subgroup was explored in a paper by Coleman and Easdown; in particular the…
An interchange ring,(R,+,*)is an abelian group with a second binary operation defined so that the interchange law (x+y)*(u+v)=(x*u)+(y*v)holds. An interchange near ring is the same structure based on a group which may not be abelian. It is…
A linear system is a pair $(P,\mathcal{L})$ where $\mathcal{L}$ is a family of subsets on a ground finite set $P$ such that $|l\cap l^\prime|\leq 1$, for every $l,l^\prime \in \mathcal{L}$. If all elements of $\mathcal{L}$ of a linear…
We give a complete classification of binary linear complementary dual codes of lengths up to $13$ and ternary linear complementary dual codes of lengths up to $10$.