default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbhay Kumar Singh 0002
Person information
- affiliation: Indian Institute of Technology Dhanbad, Dhanbad, Jharkhand, India
Other persons with the same name
- Abhay Kumar Singh — disambiguation page
- Abhay Kumar Singh 0001
![[0000-0002-3653-4587]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-3653-4587")
— Indian Institute of Technology (ISM), Dhanbad, India - Abhay Kumar Singh 0003 — GBPUAT, Pantnagar, Uttarakhand, India
- Abhay Kumar Singh 0004 — Banaras Hindu University, Varanasi, Uttar Pradesh, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j25]Pratyush Kumar, Ankur Singh, Abhay Kumar Singh:
Lee metric codes for symbol-pair read channels. Discret. Math. 349(3): 114841 (2026)- 2025
- [j24]Mrinal Kanti Bose, Udaya Parampalli, Abhay Kumar Singh:
Binary cyclic codes from permutation polynomials over ${\mathbb {F}}_{2^m}$. Des. Codes Cryptogr. 93(9): 3903-3932 (2025) - [i8]Anamika Singh, Abhay Kumar Singh, Eitan Yaakobi:
Function-Correcting Codes for b-Symbol Read Channels. CoRR abs/2503.12894 (2025) - [i7]Gyanendra K. Verma, Nupur Patanker, Abhay Kumar Singh:
Code size constraints in b-symbol read channels: A bound analysis. CoRR abs/2504.10088 (2025) - [i6]Mrinal Kanti Bose, Udaya Parampalli, Abhay Kumar Singh:
Binary cyclic codes from permutation polynomials over 𝔽2m. CoRR abs/2504.14674 (2025) - [i5]Gyanendra K. Verma, Anamika Singh, Abhay Kumar Singh:
Function-Correcting b-symbol Codes for Locally (λ, ρ,b)-Functions. CoRR abs/2505.09473 (2025) - [i4]Mrinal Kanti Bose, Abhay Kumar Singh:
Several classes of p-ary linear codes with few-weights derived from Weil sums. CoRR abs/2510.25578 (2025) - 2024
- [j23]Ekta Bindal, Abhay Kumar Singh:
Secure and Compact: A New Variant of McEliece Cryptosystem. IEEE Access 12: 35586-35596 (2024) - [j22]Hai Quang Dinh, Atul Gaur, Pratyush Kumar, Manoj Kumar Singh, Abhay Kumar Singh:
Cyclic codes over rings of matrices. Adv. Math. Commun. 18(4): 1100-1122 (2024) - [j21]Siddhartha Siddhiprada Bhoi, Udaya Parampalli, Abhay Kumar Singh:
Construction of DNA codes with multiple constrained properties. Cryptogr. Commun. 16(5): 1135-1149 (2024) - [j20]Narendra Kumar, Siddhartha Siddhiprada Bhoi, Abhay Kumar Singh:
Corrigendum to "A study of primer design with w-constacyclic shift over F4" [Theor. Comp. Sci. 960 (2023) 113925]. Theor. Comput. Sci. 988: 114205 (2024) - [c2]Ekta Bindal, Abhay Kumar Singh, Manoj Kumar Singh:
A Novel PQ-KEM Based on Coding Theory. INDOCRYPT (2) 2024: 257-278 - [i3]Vatsal Pramod Jha, Udaya Parampalli, Abhay Kumar Singh:
A Symbol-Pair Decoder for CSS Codes. CoRR abs/2409.10979 (2024) - 2023
- [j19]Hai Q. Dinh, Narendra Kumar, Abhay Kumar Singh, Manoj Kumar Singh, Indivar Gupta, Paravee Maneejuk:
On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring. Appl. Algebra Eng. Commun. Comput. 34(1): 111-128 (2023) - [j18]Hai Q. Dinh, Abhay Kumar Singh, Madhu Kant Thakur:
On symbol-pair distances of repeated-root constacyclic codes of length 2ps over ${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$ and MDS symbol-pair codes. Appl. Algebra Eng. Commun. Comput. 34(6): 1027-1043 (2023) - [j17]Narendra Kumar, Siddhartha Siddhiprada Bhoi, Ruchir Gupta, Abhay Kumar Singh:
Sliding window symbol-pair constrained codes for energy harvesting. Ann. des Télécommunications 78(1-2): 71-77 (2023) - [j16]Pooja Mishra, Chiranjeev Bhaya, Arup Kumar Pal, Abhay Kumar Singh:
A medical image cryptosystem using bit-level diffusion with DNA coding. J. Ambient Intell. Humaniz. Comput. 14(3): 1731-1752 (2023) - [j15]Narendra Kumar, Siddhartha Siddhiprada Bhoi, Abhay Kumar Singh:
A study of primer design with w-constacyclic shift over F4. Theor. Comput. Sci. 960: 113925 (2023) - 2022
- [j14]Hai Q. Dinh, Narendra Kumar, Abhay Kumar Singh:
A study of quantum codes obtained from cyclic codes over a non-chain ring. Cryptogr. Commun. 14(4): 909-923 (2022) - [j13]Hai Quang Dinh, Sampurna Satpati, Abhay Kumar Singh:
Construction of optimal codes from a class of constacyclic codes. J. Appl. Math. Comput. 68(6): 3961-3977 (2022) - [c1]Vatsal Pramod Jha, Udaya Parampalli, Abhay Kumar Singh:
Stabilizer codes and Symbol-Pair Metric are Related. ISIT 2022: 2969-2973 - [i2]Siddhartha Siddhiprada Bhoi, Parampalli Udaya, Abhay Kumar Singh:
Construction of Multiple Constrained DNA Codes. CoRR abs/2211.16096 (2022) - 2021
- [j12]Hai Q. Dinh, Abhay Kumar Singh, Madhu Kant Thakur:
On Hamming and b-symbol distance distributions of repeated-root constacyclic codes of length $$4p^s$$ over $${\pmb {\mathbb {F}}}_{p^m}+u {\pmb {\mathbb {F}}}_{p^m}$$. J. Appl. Math. Comput. 66(1-2): 885-905 (2021) - [j11]Pooja Mishra, Chiranjeev Bhaya, Arup Kumar Pal, Abhay Kumar Singh:
A novel binary operator for designing medical and natural image cryptosystems. Signal Process. Image Commun. 98: 116377 (2021) - 2020
- [j10]Hai Q. Dinh, Atul Gaur, Indivar Gupta, Abhay Kumar Singh, Manoj Kumar Singh, Roengchai Tansuchat:
Hamming distance of repeated-root constacyclic codes of length 2ps over ${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$. Appl. Algebra Eng. Commun. Comput. 31(3-4): 291-305 (2020) - [j9]Hai Q. Dinh, Atul Gaur, Abhay Kumar Singh, Manoj Kumar Singh, Woraphon Yamaka:
b-Symbol Distance of Constacylic Codes of Length ps Over Fpm + uFpm. IEEE Access 8: 67330-67341 (2020) - [j8]Hai Q. Dinh, Abhay Kumar Singh, Pratyush Kumar, Songsak Sriboonchitta:
Cyclic codes over the ring GR(pe, m)[u]∕〈uk〉. Discret. Math. 343(1): 111543 (2020) - [j7]Pooja Mishra, Chiranjeev Bhaya, Arup Kumar Pal, Abhay Kumar Singh:
Compressed DNA Coding Using Minimum Variance Huffman Tree. IEEE Commun. Lett. 24(8): 1602-1606 (2020)
2010 – 2019
- 2019
- [j6]Hai Q. Dinh, Poom Kumam, Pardeep Kumar, Sampurna Satpati, Abhay Kumar Singh, Woraphon Yamaka:
MDS Symbol-Pair Repeated-Root Constacylic Codes of Prime Power Lengths Over 𝔽pm + u𝔽pm. IEEE Access 7: 145039-145048 (2019) - [j5]Hai Q. Dinh, Abhay Kumar Singh, Sukhamoy Pattanayak, Songsak Sriboonchitta:
Construction of cyclic DNA codes over the ring Z4[u]/〈u2-1〉 based on the deletion distance. Theor. Comput. Sci. 773: 27-42 (2019) - 2018
- [j4]Hai Q. Dinh, Abhay Kumar Singh, Sukhamoy Pattanayak, Songsak Sriboonchitta:
Cyclic DNA codes over the ring 𝔽2+u𝔽2+v𝔽2+uv𝔽2+v2𝔽2+uv2𝔽2. Des. Codes Cryptogr. 86(7): 1451-1467 (2018) - [j3]Hai Q. Dinh, Abhay Kumar Singh, Pratyush Kumar, Songsak Sriboonchitta:
On the structure of cyclic codes over the ring Z2s[u]∕〈uk〉. Discret. Math. 341(8): 2243-2275 (2018) - [j2]Hai Q. Dinh, Bac Trong Nguyen, Abhay Kumar Singh, Songsak Sriboonchitta:
On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths. IEEE Trans. Inf. Theory 64(4): 2417-2430 (2018) - 2015
- [j1]Abhay Kumar Singh, Pramod Kumar Kewat:
On cyclic codes over the ring Zp[u] / 〈uk〉. Des. Codes Cryptogr. 74(1): 1-13 (2015) - 2012
- [i1]Abhay Kumar Singh, Pramod Kumar Kewat:
On cyclic codes over the ring $Z_p + uZ_p + ... + u^{k-1}Z_p$. CoRR abs/1205.4148 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-11-28 13:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
