K. Hansda

collaborators

5 papers

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 $I^$ -constacyclic codes of length $4 p^{s}$ over the finite commutative chain ring $R_{3…

cs.IT2026

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

Biplab Chatterjee, Sihem Mesnager, Ratnesh Kumar Mishra +2

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

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…

cs.IT2025

Linear Codes Derived from the Structure of Unit Graphs Over $Z_{n}$

Apurba Sarkar, Kalyan Hansda, Makhan Maji

In this paper, we study the unit graph $G (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…

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​

Structure and Construction of Two-Dimensional Minimal Linear Codes over the rings Zpn​ with Applications to Secret Sharing

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

Linear Codes Derived from the Structure of Unit Graphs Over Zn​

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}}$

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

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

Linear Codes Derived from the Structure of Unit Graphs Over $Z_{n}$