NILAY KUMAR MONDAL

About

Nilay Kumar Mondal joined the Department of Mathematics at SRM Institute of Science and Technology as an Assistant Professor (Research) in March 2025. He earned his Ph.D. from the Department of Mathematics and Computing, IIT (ISM) Dhanbad in November 2022 under the guidance of Prof. Pramod Kumar Kewat. Following his doctoral studies, he pursued postdoctoral research at the Institute of Mathematical Sciences, Ewha Womans University, Seoul, South Korea working under the mentorship of Prof. Yoonjin Lee until February 2025.

His research expertise lies in Algebraic Coding Theory, a branch of Mathematics and Information Theory that studies the design and analysis of error-correcting codes using algebraic techniques. Applications of Algebraic Coding Theory span digital communication, data storage, and cryptography, enabling reliable transmission of data over noisy channels.

Employment

• SRM Institute of Science and Technology Assistant Professor (Research)
  2025 - Present
• Ewha Womans University Research Professor
  2024 - 2025
• Ewha Womans University Postdoctoral Researcher
  2023 - 2024

Education

Education history is unavailable.

Projects & Funding

Projects & funding information is unavailable.

Publications (9)

• Locally repairable codes and minimal codes by homogenization of down-sets
  Cryptography and Communications 2026 DOI: 10.1007/s12095-026-00887-x
  +Save
• Homogenization of binary linear codes and their applications
  Finite Fields and Their Applications 2025 DOI: 10.1016/j.ffa.2025.102589
  +Save
• Optimal binary few-weight codes using a mixed alphabet ring and simplicial complexes
  IEEE Transactions on Information Theory 2024 DOI: 10.1109/tit.2024.3384067
  +Save
• Two classes of few-Lee weight Z2[u]-linear codes using simplicial complexes and minimal codes via Gray map
  Discrete Mathematics 2023 DOI: 10.1016/j.disc.2023.113650
  +Save
• Lee distance distribution of repeated-root constacyclic codes over $$\hbox {GR}\left( 2^e,m\right) $$ and related MDS codes
  Journal of Applied Mathematics and Computing 2022 DOI: 10.1007/s12190-021-01694-8
  +Save
• Maximum distance separable repeated-root constacyclic codes over $$\mathbb {F}_{2^m}+u\mathbb {F}_{2^m}$$ with respect to the Lee distance
  Applicable Algebra in Engineering, Communication and Computing 2022 DOI: 10.1007/s00200-022-00568-1
  +Save
• Symbol-pair distance of some repeated-root constacyclic codes of length $$p^s$$ over the Galois ring $${{\,\mathrm{GR}\,}}(p^a,m)$$
  Applicable Algebra in Engineering, Communication and Computing 2022 DOI: 10.1007/s00200-022-00544-9
  +Save
• Lee distance of cyclic and (1 + uγ)-constacyclic codes of length 2 over F2m+uF2m
  Discrete Mathematics 2021 DOI: 10.1016/j.disc.2021.112551
  +Save
• Lee Distance of (4z – 1)-Constacyclic Codes of Length 2 s Over the Galois Ring GR(2 a ,m)
  IEEE Communications Letters 2021 DOI: 10.1109/lcomm.2021.3075699
  +Save