default search action
Sachin Pathak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]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) - [j9]Sachin Pathak, Anuradha Sharma:
On the hulls of cyclic codes of oddly even length over Z4. Discret. Math. 347(3): 113796 (2024) - [j8]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) - [i2]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
- [j7]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) - [j6]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) - 2022
- [i1]Cristina Fernández-Córdoba, Sachin Pathak, Ashish Kumar Upadhyay:
On ZprZprZps-Additive Cyclic Codes. CoRR abs/2202.11454 (2022) - 2021
- [j5]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) - [j4]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) - [j3]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) - 2020
- [j2]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) - [j1]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)
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-07-08 22:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint