Related papers: Further Results on Homogeneous Two-Weight Codes
In this paper, we introduce the homogeneous weight and homogeneous Gray map over the ring $R_{q}=\mathbb{F}_{2}[u_{1},u_{2},\ldots,u_{q}]/\left\langle u_{i}^{2}=0,u_{i}u_{j}=u_{j}u_{i}\right\rangle$ for $q \geq 2$. We also consider the…
We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that…
Given an $r$-uniform hypergraph $H=(V,E)$ and a weight function $\omega:E\to\{1,\dots,w\}$, a coloring of vertices of $H$, induced by $\omega$, is defined by $c(v) = \sum_{e\ni v} w(e)$ for all $v\in V$. If there exists such a coloring that…
In this paper, the homogeneous weights of matrix product codes over finite principal ideal rings are studied and a lower bound for the minimum homogeneous weights of such matrix product codes is obtained.
We study the class of hyponormal 2-variable weighted shifts with two consecutive equal weights in the weight sequence of one of the coordinate operators. We show that under natural assumptions on the coordinate operators, the presence of…
In this paper, we construct an infinite family of five-weight codes from trace codes over the ring $R=\mathbb{F}_2+u\mathbb{F}_2$, where $u^2=0.$ The trace codes have the algebraic structure of abelian codes. Their Lee weight is computed by…
Inspired by the Z2Z4-additive codes, linear codes over Z2^r x(Z2+uZ2)^s have been introduced by Aydogdu et al. more recently. Although these family of codes are similar to each other, linear codes over Z2^r x(Z2+uZ2)^s have some advantages…
In this work, new construction methods for self-dual codes are given. The methods use the short Kharaghani array and a variation of it. These are applicable to any commutative Frobenius ring. We apply the constructions over the ring F_2 +…
We show that regular homogeneous two-weight $\mathbb{Z}_{p^k}$-codes where $p$ is odd and $k\geqslant 2$ with dual Hamming distance at least four do not exist. The proof relies on existence conditions for the strongly regular graph built on…
The concept of parity check matrices of linear binary codes has been extended by Heden [9] to parity check systems of nonlinear binary codes. In the present paper we extend this concept to parity check systems of nonlinear codes over finite…
Strongly walk regular graphs (SWRGs or $s$-SWRGs) form a natural generalization of strongly regular graphs (SRGs) where paths of length~2 are replaced by paths of length~$s$. They can be constructed as coset graphs of the duals of…
It is known that for binary codes one can use Gr\"obner bases to obtain a subset of codewords of minimal support that can be used to determine the second generalized Hamming weight of the code. In this paper we establish conditions on a…
Let $f(u)$ be a polynomial of degree $m, m \geq 2,$ which splits into distinct linear factors over a finite field $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u]/\langle f(u)\rangle$ be a finite non-chain ring. In an earlier paper, we…
There is a nice combinatorial formula of P. Beelen and M. Datta for the $r$-th generalized Hamming weight of an affine cartesian code. Using this combinatorial formula we give an easy to evaluate formula to compute the $r$-th generalized…
The cyclic codes with parity check polynomial the reciprocal of the characteristic polynomial of the Fibonacci recurrence over a prime finite field are shown to have either one weight or two weights. When these codes are irreducible cyclic…
The real monomial representations of Clifford algebras give rise to two sequences of bent functions. For each of these sequences, the corresponding Cayley graphs are strongly regular graphs, and the corresponding sequences of strongly…
The KP and 2D Toda tau-functions of hypergeometric type that serve as generating functions for weighted single and double Hurwitz numbers are related to the topological recursion programme. A graphical representation of such weighted…
Every second flat Reidemeister move of knot projections can be decomposed into two types thorough an inverse or direct self-tangency modification, respectively called strong or weak, when orientations of the knot projections are arbitrarily…
A kind of self-dual quasi-abelian codes of index $2$ over any finite field $F$ is introduced. By counting the number of such codes and the number of the codes of this kind whose relative minimum weights are small, such codes are proved to…
We explore algebraic and spectral properties of weighted graphs containing twin vertices that are useful in quantum state transfer. We extend the notion of adjacency strong cospectrality to arbitrary Hermitian matrices, with focus on the…