Related papers: On Some Classes of $\mathbb{Z}_{2}\mathbb{Z}_{4}-$…
We consider quasi-perfect codes in $\mathbb{Z}^n$ over the $\ell_p$ metric, $2 \leq p < \infty$. Through a computational approach, we determine all radii for which there are linear quasi-perfect codes for $p = 2$ and $n = 2, 3$. Moreover,…
Upper bounds on the minimum Lee distance of codes that are linear over ${\mathbb Z}_q$, $q=p^t$, $p$ prime are discussed. The bounds are Singleton like, depending on the length, rank, and alphabet size of the code. Codes meeting such bounds…
We define and study burst-covering codes. We provide some general bounds connecting the parameters of a code with its burst-covering radius. We then provide stronger bounds on the burst-covering radius of cyclic codes, by employing…
We give a complete list of the points in the spectrum $$\mathcal{Z}=\{\inf_{(x,y)\in\Lambda,xy\neq0}{\left\vert xy\right\vert},\,\text{$\Lambda$ is a unimodular rational lattice of $\mathbb{R}^2$}\}$$ above $\frac{1}{3}.$ We further show…
We determine projective equations of smooth complex cubic fourfolds with symplectic automorphisms by classifying 6-dimensional projective representations of Laza and Zheng's 34 groups. In particular, we determine the number of irreducible…
We classify the periodic digit strings which arise from periodic billiard orbits on the four convex $n$-gons $\Delta$ which tile $\mathbb{R}^2$ under reflection, answering problem a posed by Baxter and Umble. $\Delta$ is either an…
The Nordstrom-Robinson, Kerdock, and (slightly modified) Pre\- parata codes are shown to be linear over $\ZZ_4$, the integers $\bmod~4$. The Kerdock and Preparata codes are duals over $\ZZ_4$, and the Nordstrom-Robinson code is self-dual.…
We collect a number of elementary constructions of $\Z_2$ harmonic $1$-forms, and of families of these objects. These examples show that the branching set $\Sigma$ of a $\Z_2$ harmonic 1-form may exhibit the following features: i) $\Sigma$…
Recently, simplicial complexes are used in constructions of several infinite families of minimal and optimal linear codes by Hyun {\em et al.} Building upon their research, in this paper more linear codes over the ring $\mathbb{Z}_4$ are…
In this paper, we investigate the structure and properties of additive complementary dual (ACD) codes over the mixed alphabet $\mathbb{F}_2\mathbb{F}_4$ relative to a certain inner product defined over $\mathbb{F}_2\mathbb{F}_4$. We…
We compute a complete set of isomorphism classes of cubic fourfolds over $\mathbb{F}_2$. Using this, we are able to compile statistics about various invariants of cubic fourfolds, including their counts of points, lines, and planes; all…
Let $\Lambda=\Bbb Z[t,t^{-1}]$ be the ring of Laurent polynomials over $\Bbb Z$. We classify all $\Lambda$-modules $M$ with $|M|=p^n$, where $p$ is a primes and $n\le 4$. Consequently, we have a classification of Alexander quandles of order…
In this article, we introduce and study the concept of the exponent of a cyclic code over a finite field $\mathbb{F}_q.$ We give a relation between the exponent of a cyclic code and its dual code. Finally, we introduce and determine the…
A complete description of 4-by-4 matrices $\begin{bmatrix}\alpha I & C \\D & \beta I\end{bmatrix}$, with scalar 2-by-2 diagonal blocks, for which the numerical range is the convex hull of two non-concentric ellipses is given. This result is…
We consider a two-unicast-$Z$ network over a directed acyclic graph of unit capacitated edges; the two-unicast-$Z$ network is a special case of two-unicast networks where one of the destinations has apriori side information of the unwanted…
A new family of binary linear completely transitive (and, therefore, completely regular) codes is constructed. The covering radius of these codes is growing with the length of the code. In particular, for any integer r > 1, there exist two…
The scattering of two excitations (both of the simplest kind) in the magnetic model related to the $Z_n$\--Baxter model is naturally described for $n \rightarrow \infty$ in terms of the Macdonald polynomials for root system $A_1$. These…
Many literatures consider the extended Reed-Solomon (RS) codes, including their dual codes and covering radii, but few focus on extended algebraic geometry (AG) codes of genus $g\ge1$. In this paper, we investigate extended AG codes and…
We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell$-complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell$. This concept generalizes…
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes. In this paper, we introduce the notion of A-covered codes, that is, codes that can be decoded through a polynomial time algorithm A…