Abhay Kumar Singh

About

Abhay Kumar Singh received his M.Sc. degree in Mathematics from the Institute of Science, Banaras Hindu University (BHU), Varanasi, India, in 2002, and his Ph.D. in Algebra from IIT (BHU), Varanasi, India, in 2007. He is currently working as a Professor in the Department of Mathematics and Computing at IIT Dhanbad, India.

His research interests include Algebraic Coding Theory, Quantum Computing, Code-Based Cryptography, and Error-Correcting Codes for DNA Data Storage. He has published extensively in several highly reputed journals and conferences such as IEEE Transactions on Information Theory, IEEE Transactions on NanoBioscience, IEEE Communications Letters, Designs, Codes and Cryptography, Discrete Mathematics, Theoretical Computer Science, Journal of Algebra and Its Applications, Applicable Algebra in Engineering, Communication and Computing, Cryptography and Communications, ISIT, Indocrypt, SETA, and others.

He is actively involved in multiple research projects on quantum coding and post-quantum cryptography funded by the Government of India. He also serves as a visiting professor at the Quantum Computing Centre, University of Melbourne, Australia, and at the Vietnam Institute for Advanced Study in Mathematics (VIASM), Hanoi.

Prof. Singh has delivered invited talks at numerous IITs, NITs, IIITs, and central universities across India, as well as at international institutions including the University of Melbourne, Monash University, RMIT University (Australia), and VIASM, Hanoi.

Employment

• Indian Institute of Technology Dhanbad Professor
  2026 - Present

Education

Education history is unavailable.

Projects & Funding

Projects & funding information is unavailable.

Publications (57)

• Function-Correcting b-Symbol Codes for Locally (λ, ρ, b)-Functions
  IEEE Transactions on Information Theory 2026 DOI: 10.1109/TIT.2025.3633259
  +Save
• Construction of Primers for DNA-Based Storage Systems
  IEEE Transactions on NanoBioscience 2026 DOI: 10.1109/TNB.2026.3720321
  +Save
• Lee metric codes for symbol-pair read channels
  Discrete Mathematics 2026 DOI: 10.1016/j.disc.2025.114841
  +Save
• Code Size Constraints in b-Symbol Read Channels: A Bound Analysis
  IEEE Transactions on Information Theory 2025 DOI: 10.1109/TIT.2025.3622757
  +Save
• A Novel PQ-KEM Based on Coding Theory
  2025 DOI: 10.1007/978-3-031-80311-6_13
  +Save
• Binary cyclic codes from permutation polynomials over F2m
  Designs Codes and Cryptography 2025 DOI: 10.1007/s10623-025-01661-5
  +Save
• Code size constraints in b-symbol read channels: A bound analysis
  ArXiv 2025
  +Save
• Function-Correcting Codes for b−Symbol Read Channels
  Arxiv 2025 DOI: 10.48550/arXiv.2503.12894
  +Save
• ON SYMBOL-PAIR DISTANCE DISTRIBUTIONS OF REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4ps AND MDS CODES
  Advances in Mathematics of Communications 2025 DOI: 10.3934/amc.2025001
  +Save
• Secure and Compact: A New Variant of McEliece Cryptosystem
  IEEE Access 2024 DOI: 10.1109/ACCESS.2024.3373314
  +Save