default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAshish Kumar Upadhyay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Hai Q. Dinh, Bhanu Pratap Yadav, Sachin Pathak
, Abhyendra Prasad, Ashish Kumar Upadhyay, Woraphon Yamaka:
ℤ4ℤ4ℤ4-additive cyclic codes are asymptotically good. Appl. Algebra Eng. Commun. Comput. 35(4): 485-505 (2024)- [j24]Nishant Kumar, Sudhan Majhi, Ashish Kumar Upadhyay:
A direct construction of complete complementary code with zero correlation zone property for prime-power length. Cryptogr. Commun. 16(2): 403-426 (2024) - [j23]Om Prakash Pandey, Sachin Pathak, Awadhesh Kumar Shukla, Vipul Mishra, Ashish Kumar Upadhyay:
A study of QECCs and EAQECCs construction from cyclic codes over the ring ${\mathbb {F}}_q+v_1{\mathbb {F}}_q+v_2{\mathbb {F}}_q+\cdots +v_s{\mathbb {F}}_q$. Quantum Inf. Process. 23(2): 31 (2024) - [i9]Awadhesh Kumar Shukla, Sachin Pathak, Om Prakash Pandey, Vipul Mishra, Ashish Kumar Upadhyay:
On (θ, Θ)-cyclic codes and their applications in constructing QECCs. CoRR abs/2404.00613 (2024) - 2023
- [j22]Hai Q. Dinh, Bhanu Pratap Yadav, Bac Trong Nguyen, Ashish Kumar Upadhyay, Woraphon Yamaka:
Self-Dual Double Circulant, Self-Dual Double Negacirculant and LCD Double Negacirculant Codes Over the Ring Fq[u,v]/2 - u, v2-v, uv-vu>. IEEE Access 11: 92898-92912 (2023) - [j21]Hai Q. Dinh, Tushar Bag, Kanat Abdukhalikov, Sachin Pathak, Ashish Kumar Upadhyay, Ramakrishna Bandi, Warattaya Chinnakum:
On a class of skew constacyclic codes over mixed alphabets and applications in constructing optimal and quantum codes. Cryptogr. Commun. 15(1): 171-198 (2023) - [j20]Hai Q. Dinh, Bhanu Pratap Yadav, Tushar Bag, Daniel Panario, Ashish Kumar Upadhyay:
Self-dual and LCD double circulant and double negacirculant codes over a family of finite rings $ \mathbb {F}_{q}[v_{1}, v_{2},\dots ,v_{t}]$. Cryptogr. Commun. 15(3): 529-551 (2023) - [j19]Hai Q. Dinh, Bhanu Pratap Yadav, Sachin Pathak, Abhyendra Prasad, Ashish Kumar Upadhyay, Woraphon Yamaka:
$${\mathbb {F}}_{2}[u]{\mathbb {F}}_{2}[u] $$-additive cyclic codes are asymptotically good. J. Appl. Math. Comput. 69(1): 1037-1056 (2023) - [j18]Rajkaran Kori, Abhyendra Prasad, Ashish Kumar Upadhyay:
Reciprocal degree distance and Hamiltonian properties of graphs. Oper. Res. Lett. 51(6): 623-627 (2023) - [i8]Nishant Kumar, Sudhan Majhi, Ashish Kumar Upadhyay:
A Direct Construction of Near-Optimal Multiple ZCZ Sequence Sets. CoRR abs/2301.02144 (2023) - 2022
- [j17]Tushar Bag, Hai Q. Dinh, Kanat Abdukhalikov, Ashish Kumar Upadhyay, Woraphon Yamaka:
Constacyclic codes over $${\pmb {\mathbb {F}}}_{q^2}[u]/\langle u^2-w^2 \rangle $$ and their application in quantum code construction. J. Appl. Math. Comput. 68(6): 3821-3834 (2022) - [j16]Gobinda Ghosh, Sudhan Majhi, Palash Sarkar, Ashish Kumar Upadhyay:
Direct Construction of Optimal Z-Complementary Code Sets With Even Lengths by Using Generalized Boolean Functions. IEEE Signal Process. Lett. 29: 872-876 (2022) - [i7]Cristina Fernández-Córdoba, Sachin Pathak, Ashish Kumar Upadhyay:
On ZprZprZps-Additive Cyclic Codes. CoRR abs/2202.11454 (2022) - [i6]Gobinda Ghosh, Sudhan Majhi, Ashish Kumar Upadhyay:
A Direct Construction of 2D-CCC with Arbitrary Array Size and Flexible Set Size Using Multivariable Function. CoRR abs/2207.13395 (2022) - [i5]Nishant Kumar, Sudhan Majhi, Ashish Kumar Upadhyay:
A Direct Construction of Complete Complementary Code with Zero Correlation Zone property for Prime-Power Length. CoRR abs/2207.13642 (2022) - 2021
- [j15]Hai Q. Dinh, Tushar Bag, Ashish Kumar Upadhyay, Ramakrishna Bandi, Roengchai Tansuchat:
A class of skew cyclic codes and application in quantum codes construction. Discret. Math. 344(2): 112189 (2021) - [j14]Hai Q. Dinh, Sachin Pathak, Tushar Bag, Ashish Kumar Upadhyay, Ramakrishna Bandi, Woraphon Yamaka:
On F2RS-cyclic codes and their applications in constructing optimal codes. Discret. Math. 344(5): 112310 (2021) - [j13]Hai Q. Dinh, Tushar Bag, Pramod Kumar Kewat, Sachin Pathak, Ashish Kumar Upadhyay, Warattaya Chinnakum:
Constacyclic codes of length $$(p^r,p^s)$$ over mixed alphabets. J. Appl. Math. Comput. 67(1-2): 807-832 (2021) - [j12]Hai Q. Dinh, Sachin Pathak, Tushar Bag, Ashish Kumar Upadhyay, Woraphon Yamaka:
Constacyclic codes over mixed alphabets and their applications in constructing new quantum codes. Quantum Inf. Process. 20(4): 150 (2021) - [c1]Debashis Bhowmik, Dipendu Maity, Ashish Kumar Upadhyay:
A New Class of Quantum Codes Associate with a Class of Maps. ICMC 2021: 265-273 - [i4]Gobinda Ghosh, Sudhan Majhi, Palash Sarkar, Ashish Kumar Upadhyay:
Direct Construction of Optimal Z-Complementary Code Sets for all Possible Even Length by Using Pseudo-Boolean Functions. CoRR abs/2108.02689 (2021) - [i3]Nishant Kumar, Sudhan Majhi, Palash Sarkar, Ashish Kumar Upadhyay:
A Direct Construction of Prime-Power-Length Zero-Correlation Zone Sequences for QS-CDMA System. CoRR abs/2111.06675 (2021) - 2020
- [j11]Hai Q. Dinh, Tushar Bag, Ashish Kumar Upadhyay, Ramakrishna Bandi, Warattaya Chinnakum:
On the Structure of Cyclic Codes Over 𝔽qRS and Applications in Quantum and LCD Codes Constructions. IEEE Access 8: 18902-18914 (2020) - [j10]Hai Q. Dinh, Sachin Pathak, Tushar Bag, Ashish Kumar Upadhyay, Warattaya Chinnakum:
A Study of FqR-Cyclic Codes and Their Applications in Constructing Quantum Codes. IEEE Access 8: 190049-190063 (2020) - [j9]Hai Q. Dinh, Tushar Bag, Sachin Pathak, Ashish Kumar Upadhyay, Warattaya Chinnakum:
Quantum Codes Obtained From Constacyclic Codes Over a Family of Finite Rings Fp[u₁, u₂, ..., us]. IEEE Access 8: 194082-194091 (2020) - [j8]Dipendu Maity, Ashish Kumar Upadhyay:
Corrigendum to "On the enumeration of a class of toroidal graphs" [Contrib. Discrete Math. 13 (2018), no. 1, 79-119]. Contributions Discret. Math. 15(1): 10-11 (2020) - [j7]Tushar Bag, Hai Q. Dinh, Ashish Kumar Upadhyay, Ramakrishna Bandi, Woraphon Yamaka:
Quantum codes from skew constacyclic codes over the ring Fq[u, v]∕〈u2-1, v2-1, uv-vu〉. Discret. Math. 343(3): 111737 (2020) - [j6]Tushar Bag, Hai Q. Dinh, Ashish Kumar Upadhyay, Woraphon Yamaka:
New Non-Binary Quantum Codes from Cyclic Codes Over Product Rings. IEEE Commun. Lett. 24(3): 486-490 (2020) - [i2]Debashis Bhowmik, Dipendu Maity, Bhanu Pratap Yadav, Ashish Kumar Upadhyay:
New Classes of Quantum Codes Associated with Surface Maps. CoRR abs/2007.01684 (2020)
2010 – 2019
- 2019
- [j5]Tushar Bag, Mohammad Ashraf, Ghulam Mohammad, Ashish Kumar Upadhyay:
Quantum codes from \((1-2u_1-2u_2-\cdots -2u_m)\) -skew constacyclic codes over the ring \(F_q+u_1F_{q}+\cdots +u_{2m}F_{q}\). Quantum Inf. Process. 18(9): 270 (2019) - 2018
- [j4]Ashish Kumar Upadhyay, Dipendu Maity:
On the enumeration of a class of toroidal graphs. Contributions Discret. Math. 13(1) (2018) - [j3]Tushar Bag, Habibul Islam, Om Prakash, Ashish Kumar Upadhyay:
A study of constacyclic codes over the ring ℤ4[u]/〈u2 - 3〉. Discret. Math. Algorithms Appl. 10(4): 1850056:1-1850056:10 (2018) - 2014
- [j2]Ashish Kumar Upadhyay, Dipendu Maity:
A note on edge-disjoint contractible Hamiltonian cycles in polyhedral maps. Electron. J. Graph Theory Appl. 2(2): 160-165 (2014) - 2012
- [j1]Dipendu Maity, Ashish Kumar Upadhyay:
Contractible Hamiltonian cycles in Polyhedral Maps. Discret. Math. Algorithms Appl. 4(4) (2012) - 2010
- [i1]Ashish Kumar Upadhyay:
Contractible Hamiltonian Cycles in Triangulated Surfaces. CoRR abs/1003.5268 (2010)
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 2024-10-07 21:19 CEST 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:
