K. Hansda

activity

20172026

most citedMinimal bi-ideals in regular and completely regular ordered semigroups

4 citations · 5 across the 13 of their papers we have counts for

collaborators

16 papers

cs.IT2026

Graph-Based Linear Codes Associated with the Finite Ring $F_{p} [x] / ⟨ x^{4} ⟩$

Apurba Sarkar, Kalyan Hansda, Makhan Maji

We investigate the linear codes derived from the zero-divisor graph $Γ (R)$ of the finite local ring $R = F_{p} [x] / ⟨ x^{4} ⟩$ for an odd prime $p$ . Using an equitab…

cs.IT2026

Spectral Characterization and Network Systems Dynamics of Zero-Divisor Topologies over $F_{p} [x] / ⟨ x^{4} ⟩$ : Consensus, Reliability, and Transport

Apurba Sarkar, Kalyan Hansda, Makhan Maji

For an odd prime $p$ , let $Γ (R)$ denote the zero-divisor graph associated with the finite local ring $R = F_{p} [x] / ⟨ x^{4} ⟩$ , having $p^{3} - 1$ vertices and size $|…

cs.IT2026

Cyclic Codes of Length 7_p^s over F_p^m + uF_p^m : Characterization, Duals, and Applications to Quantum and LCD Codes

Payel Chandra, Kalyan Hansda

Let $R_{2} = F_{p^{m}} + u F_{p^{m}}$ ( $u^{2} = 0$ ), where $p$ is an odd prime and $m, s \in N$ . For $p \equiv 3, 5 (mod 7)$ with $g cd (m, 6) = 1$ , the cyclotomic…

cs.IT2026

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

Apurba Sarkar, Kalyan Hansda, Makhan Maji

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…

cs.IT2026

On symbol-pair distance of repeated-root constacyclic codes of length $4 p^{s}$ over $F_{p^{m}} + u F_{p^{m}} + u^{2} F_{p^{m}}$

Payel Chandra, Kalyan Hansda

This paper completely determines the symbol-pair distance distributions of all repeated-root $Δ$ -constacyclic codes of length $4 p^{s}$ over the finite commutative chain ring $R_{3}…

cs.IT2026

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

Biplab Chatterjee, Sihem Mesnager, Ratnesh Kumar Mishra +2

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 minima…

Graph-Based Linear Codes Associated with the Finite Ring Fp​[x]/⟨x4⟩

Spectral Characterization and Network Systems Dynamics of Zero-Divisor Topologies over Fp​[x]/⟨x4⟩: Consensus, Reliability, and Transport

Cyclic Codes of Length 7_p^s over F_p^m + uF_p^m : Characterization, Duals, and Applications to Quantum and LCD Codes

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

On symbol-pair distance of repeated-root constacyclic codes of length 4ps over Fpm​+uFpm​+u2Fpm​

Function-Based Minimal Linear Codes over Galois Rings GR(pn,ℓ): Minimality Criteria and Infinite Constructions

Graph-Based Linear Codes Associated with the Finite Ring $F_{p} [x] / ⟨ x^{4} ⟩$

Spectral Characterization and Network Systems Dynamics of Zero-Divisor Topologies over $F_{p} [x] / ⟨ x^{4} ⟩$ : Consensus, Reliability, and Transport

On symbol-pair distance of repeated-root constacyclic codes of length $4 p^{s}$ over $F_{p^{m}} + u F_{p^{m}} + u^{2} F_{p^{m}}$

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