SearcharxivSearch

arXiv subjects

Makhan Maji

Publications and source records attributed to Makhan Maji.

5 recordsLinked to original sources

Spectral Characterization and Network Systems Dynamics of Zero-Divisor Topologies over $\mathbb{F}_p[x]/\langle x^4\rangle$: Consensus, Reliability, and Transport

For an odd prime $p$, let $Γ(R)$ denote the zero-divisor graph associated with the finite local ring $R= \mathbb{F}_p[x]/\langle x^4 \rangle$, having $p^3 - 1$ vertices and size $|E(Γ(R))| = \frac{1}{2}(3p^4 - 4p^3 - p^2 + 2)$. Using an equitable 4-cell partition induced by the ideal filtration $\langle u^3 \rangle \subset \langle u^2 \rangle \subset \langle u \rangle$, we prove that $\operatorname{Spec}_A(Γ(R))$ decomposes into discrete levels $λ\in \{0, -1\}$ with multiplicities $p^3 - p^2 - 1$ and $p^2 - 3$, respectively, alongside three irrational roots of an irreducible cubic polynomial $P_3(λ) = 0$, yielding adjacency energy $ε(Γ(R)) = 4p^2 + \mathcal{O}(p)$. In contrast, the Laplacian spectrum is entirely integral: $\operatorname{Spec}_L(Γ(R)) = \{0^1, (p - 1)^{p^3 - p^2}, (p^2 - 1)^{p^2 - p - 1}, (p^3 - 1)^{p - 1}\}$. Consequently, the tree entropy satisfies $z(Γ(R)) = \ln p - \frac{1}{p} + \frac{\ln p}{p} + \mathcal{O}(\frac{\ln p}{p^2})$, with small-failure unreliability bounded by $p^2(p - 1)(1 - q)^{p-1}$. In linear consensus $\dot{x} = -Lx$, error trajectories decouple into three modal timescales $\{ (p^3 - 1)^{-1}, (p^2 - 1)^{-1}, (p - 1)^{-1} \}$ with algebraic connectivity $α(Γ(R)) = p - 1$ and steady-state $H_2$ error variance $H_2^2 = \frac{Kf(Γ(R))}{2n^2} = \frac{1}{2p} + \mathcal{O}(p^{-3})$. Furthermore, the Kirchhoff index yields a vanishing average resistance distance $\overline{r}(Γ(R)) = \frac{2}{p} + \mathcal{O}(p^{-3}) \to 0$, while unbiased Markovian random walks induce an asymptotic traffic concentration vector $Π= (\frac{1}{3}, 0, \frac{1}{3}, \frac{1}{3})$ with quadratic per-node core routing stress $π_{\mathrm{core}}/π_{\mathrm{periph}} \sim p^2 + p + 1$.

cs.IT

Minimal Binary Linear Codes of Dimension n+4 from Partial Spreads and Their Dual Access Structures

Minimal linear codes have significant applications in secret sharing schemes, secure multi-party computation, and cryptography. In this paper, we propose a generic construction of a new family of minimal binary linear codes with dimension n+4 from a special class of Boolean functions. By leveraging the geometric properties of partial spreads in finite fields, we determine the explicit weight distribution and weight enumerator of the constructed codes. Furthermore, we derive a necessary and sufficient condition for these codes to be minimal, and establish that the proposed family yields minimal codes that structurally violate the well-known Ashikhmin-Barg condition, making them highly desirable for advanced communication systems.

cs.IT

Structure and Construction of Two-Dimensional Minimal Linear Codes over the rings $\mathbb{Z}_{p^n}$ with Applications to Secret Sharing

Minimal linear codes play an important role in coding theory and cryptography, particularly in the construction of secret sharing schemes. In this paper, we investigate the structure and construction of two-dimensional minimal linear codes over the finite rings $\mathbb{Z}_{p^n}$. We provide an explicit construction of a family of two-dimensional linear codes generated by a structured $2\times m$ matrix over $\mathbb{Z}_{p^n}$ and prove that these codes are minimal whenever the generator matrix contains all $p^n+p^{n-1}$ essential types of column vectors. We further show that this condition is necessary: removing any of these column types destroys the resulting code's minimality. As a consequence, we establish a lower bound on the length of two-dimensional minimal linear codes over $\mathbb{Z}_{p^n}$. Several examples are presented to illustrate the construction and to verify the theoretical results. We also demonstrate that the proposed construction cannot be extended in a straightforward manner to rings of the form $\mathbb{Z}_{p^n q^l}$. Finally, we apply our results to the design of secret sharing schemes derived from minimal linear codes over $\mathbb{Z}_{p^n}$ and analyze the corresponding access structures. Our study highlights structural differences between minimal codes defined over finite rings and those over finite fields, revealing new perspectives for coding-theoretic constructions in cryptographic applications.

cs.IT

Function-Based Minimal Linear Codes over Galois Rings $\mathrm{GR}(p^{n}, \ell)$: Minimality Criteria and Infinite Constructions

In this paper, we extend a necessary and sufficient condition for a linear code over a Galois ring to be minimal and establish new bounds on the length of an $m$-dimensional minimal linear code. Building upon this structural characterization, we further generalize the function-based minimality criteria introduced by Wu \emph{et al.} (Cryptogr. Commun. 14, 875-895, 2022) from the finite field setting to the framework of Galois rings. The transition from fields to rings introduces substantial algebraic challenges due to the presence of zero divisors and the richer module structure of $\mathrm{GR}(p^{n},\ell)$. By exploiting Frobenius duality and the chain structure of Galois rings, we derive refined necessary and sufficient conditions ensuring that linear codes arising from functions over $\mathrm{GR}(p^{n},\ell)$ are minimal. As an application of these criteria, we construct several infinite families of minimal linear codes over Galois rings, thereby significantly generalizing the constructions of Wu \emph{et al.} to the ring setting. Our results provide a unified framework that connects minimality theory, module duality over Frobenius rings, and function-based code constructions.

cs.IT

Linear Codes Derived from the Structure of Unit Graphs Over $\mathbb{Z}_n$

In this paper, we study the unit graph $ G(\mathbb{Z}_n) $, where $ n $ is of the form $n = p_1^{n_1} p_2^{n_2} \dots p_r^{n_r}$, with $ p_1, p_2, \dots, p_r $ being distinct prime numbers and $ n_1, n_2, \dots, n_r $ being positive integers. We establish the connectivity of $ G(\mathbb{Z}_n) $, show that its diameter is at most three, and analyze its edge connectivity. Furthermore, we construct $ q $-ary linear codes from the incidence matrix of $ G(\mathbb{Z}_n) $, explicitly determining their parameters and duals. A primary contribution of this work is the resolution of two conjectures from \cite{Jain2023} concerning the structural and coding-theoretic properties of $ G(\mathbb{Z}_n) $. These results extend the study of algebraic graph structures and highlight the interplay between number theory, graph theory, and coding theory.

cs.IT