相关论文: Ring geometries, Two-Weight Codes and Strongly Reg…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
Delsarte showed that for any projective linear code over a finite field of characteristic p with two nonzero Hamming weights w1 < w2 there exist positive integers u and s such that w1 = (p^s)u and w2 = (p^s)(u+1). Moreover, he showed that…
Projective two-weight linear codes are closely related to finite projective spaces and strongly regular graphs. In this paper, a family of $q$-ary projective two-weight linear codes is presented, where $q$ is a power of 2. The parameters of…
A code is said to be two-weight if the non-zero codewords have only two different a weight w1 and w2. Two-weight codes are closely related to strongly regular graphs. In this paper. It is shown that a consta-cyclic code of composite length…
Few-weight codes over finite chain rings are associated with combinatorial objects such as strongly regular graphs (SRGs), strongly walk-regular graphs (SWRGs) and finite geometries, and are also widely used in data storage systems and…
Let R > S be finite Frobenius rings for which there exists a trace map T from R onto S as left S modules. Let C:= {x -> T(ax + bf(x)) : a,b in R}. Then C is an S-linear subring-subcode of a left linear code over R. We consider functions f…
Two-weight linear codes are linear codes in which any nonzero codeword can have only two possible distinct weights. Those in the Hamming metric have proven to be very interesting for their connections with authentication codes, association…
Let $p$ be a prime number. Irreducible cyclic codes of length $p^2-1$ and dimension $2$ over the integers modulo $p^h$ are shown to have exactly two nonzero Hamming weights. The construction uses the Galois ring of characteristic $p^h$ and…
In \cite{shi2022few-weight}, Shi and Li studied $\mathcal{C}_D$-codes over the ring $\mathcal{R}:=\mathbb{F}_2[x,y]/\langle x^2, y^2, xy-yx\rangle$ and their binary Gray images, where $D$ is derived using certain simplicial complexes. We…
We construct two series of linear codes over finite ring $\mathbb{F}_{q}[x]/(x^2)$ and Galois ring $GR(p^2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}_{q}$ by Gray map. The…
We obtain all possible parameters of Plotkin-optimal two-Lee weight projective codes over $\mathbb{Z}_4,$ together with their weight distributions. We show the existence of codes with these parameters as well as their weight distributions…
In this paper, for an odd prime $p$, several classes of two-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from the defining sets, and then their complete weight distributions are determined by employing character…
We classify all linear completely regular codes which have covering radius $\rho = 2$ and whose dual are antipodal. For this, we firstly show several properties of such dual codes, which are two-weight codes.
Using theoretical results about the homogeneous weights for Frobenius rings, we describe the homogeneous weight for the ring family $R_k$, a recently introduced family of Frobenius rings which have been used extensively in coding theory. We…
Coding Theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. Such codes over rings had important applications and many interesting mathematical…
In this work, we define composite matrices which are derived from group rings. We extend the idea of G-codes to composite G-codes. We show that these codes are ideals in a group ring, where the ring is a finite commutative Frobenius ring…
In this paper, we consider some structures of linear codes over the ring $\mathcal{R}_k=R[v_1,\dots,v_k],$ where $v_i^2=v_i$ forall $i=1,\dots,k),$ and $R$ is a finite commutative Frobenius ring.
Let $p$ be a prime number, $q=p^s$ for a positive integer $s$. For any positive divisor $e$ of $q-1$, we construct an infinite family codes of size $q^{2m}$ with few Lee-weight. These codes are defined as trace codes over the ring…
It is well-known that few-weight linear codes have better applications in secret sharing schemes \cite{JY2006,CC2005}.In particular, projective two-weight codes are very precious as they are closely related to finite projective spaces,…