Ratnesh Kumar Mishra

collaborators

3 papers

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

Generalization the parameters of minimal linear codes over the ring $Z_{p^{l}}$ and $Z_{p_{1} p_{2}}$

Biplab Chatterjee, Ratnesh Kumar Mishra

In this article, We introduce a condition that is both necessary and sufficient for a linear code to achieve minimality when analyzed over the rings $Z_{n}$ .The fundamenta…

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

Generalization the parameters of minimal linear codes over the ring Zpl​ and Zp1​p2​​

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

Generalization the parameters of minimal linear codes over the ring $Z_{p^{l}}$ and $Z_{p_{1} p_{2}}$