Lee distance of cyclic and (1 + uγ)-constacyclic codes of length 2s over F2m+uF2m. - Hai Q. Dinh 001; Pramod Kumar Kewat; Nilay Kumar Mondal (Discret. Math., 2021)

Lee Distance of (4z - 1)-Constacyclic Codes of Length 2s Over the Galois Ring GR(2a, m). - Hai Q. Dinh 001; Pramod Kumar Kewat; Nilay Kumar Mondal (IEEE Commun. Lett., 2021)

A class of few-Lee weight Z2[u]-linear codes using simplicial complexes and minimal codes via Gray map. - Pramod Kumar Kewat; Nilay Kumar Mondal (CoRR, 2022)

Lee distance distribution of repeated-root constacyclic codes over $$ hbox {GR} left( 2^e,m right) $$ and related MDS codes. - Hai Q. Dinh 001; Pramod Kumar Kewat; Nilay Kumar Mondal (J. Appl. Math. Comput., 2022)

Two classes of few-Lee weight Z2[u]-linear codes using simplicial complexes and minimal codes via Gray map. - Pramod Kumar Kewat; Nilay Kumar Mondal (Discret. Math., 2023)

Symbol-pair distance of some repeated-root constacyclic codes of length ps over the Galois ring ${{ , mathrm{GR} , }}(p^a, m)$. - Hai Q. Dinh 001; Pramod Kumar Kewat; Nilay Kumar Mondal (Appl. Algebra Eng. Commun. Comput., 2024)

Maximum distance separable repeated-root constacyclic codes over $ mathbb {F}_{2^m}+u mathbb {F}_{2^m}$ with respect to the Lee distance. - Hai Q. Dinh 001; Pramod Kumar Kewat; Nilay Kumar Mondal (Appl. Algebra Eng. Commun. Comput., 2024)

Optimal Binary Few-Weight Codes Using a Mixed Alphabet Ring and Simplicial Complexes. - Nilay Kumar Mondal; Yoonjin Lee (IEEE Trans. Inf. Theory, 2024)

Homogenization of binary linear codes and their applications. - Jong Yoon Hyun; Nilay Kumar Mondal; Yoonjin Lee (Finite Fields Their Appl., 2025)