default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeihan Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Arezoo Soufi Karbaski, Taher Abualrub, Nuh Aydin, Peihan Liu:
Additive polycyclic codes over $ \mathbb{F}_{4} $ induced by binary vectors and some optimal codes. Adv. Math. Commun. 18(1): 116-127 (2024)- [j6]Amina Bellil, Kenza Guenda, Nuh Aydin, Peihan Liu, T. Aaron Gulliver:
Constacyclic and quasi-twisted codes over $ \mathbb{Z}_{q}[u]/\langle u^{2}-1\rangle $ and new $ \mathbb{Z}_4 $-linear codes. Adv. Math. Commun. 18(6): 1877-1892 (2024) - [i9]Sheng Yang, Peihan Liu, Cengiz Pehlevan:
Convex Relaxation for Solving Large-Margin Classifiers in Hyperbolic Space. CoRR abs/2405.17198 (2024) - 2023
- [j5]Basri Çaliskan, Nuh Aydin, Peihan Liu:
Skew cyclic codes over $\mathbb {Z}_{4}+u\mathbb {Z}_{4}+v\mathbb {Z}_{4}$. Cryptogr. Commun. 15(4): 845-858 (2023) - [j4]Taher Abualrub
, Arezoo Soufi Karbaski, Nuh Aydin, Peihan Liu:
Additive polycyclic codes over $\mathbb {\pmb {\varvec{F}}}_{4}$ induced by nonbinary polynomials. J. Appl. Math. Comput. 69(6): 4821-4832 (2023) - [j3]Fatma Çaliskan, Refia Aksoy, Nuh Aydin, Peihan Liu:
Entanglement-assisted binary quantum codes from skew cyclic codes over ${\mathbb {F}}_2 \times ({\mathbb {F}}_2+v{\mathbb {F}}_2)$. Quantum Inf. Process. 22(5): 208 (2023) - [i8]Zeliang Zhang, Peihan Liu, Xiaosen Wang, Chenliang Xu:
Improving Adversarial Transferability with Scheduled Step Size and Dual Example. CoRR abs/2301.12968 (2023) - [i7]Alyssa Huang, Peihan Liu, Ryumei Nakada, Linjun Zhang, Wanrong Zhang:
Safeguarding Data in Multimodal AI: A Differentially Private Approach to CLIP Training. CoRR abs/2306.08173 (2023) - 2022
- [j2]Nuh Aydin, Peihan Liu, Bryan Yoshino:
Polycyclic codes associated with trinomials: good codes and open questions. Des. Codes Cryptogr. 90(5): 1241-1269 (2022) - [j1]Ranjan Pal, Peihan Liu, Taoan Lu, Ed Hua:
How Hard Is Cyber-risk Management in IT/OT Systems? A Theory to Classify and Conquer Hardness of Insuring ICSs. ACM Trans. Cyber Phys. Syst. 6(4): 35:1-35:31 (2022) - [i6]Edward Small, Wei Shao, Zeliang Zhang, Peihan Liu, Jeffrey Chan, Kacper Sokol, Flora D. Salim:
How Robust is your Fair Model? Exploring the Robustness of Diverse Fairness Strategies. CoRR abs/2207.04581 (2022) - 2021
- [c2]Ranjan Pal, Taoan Lu, Peihan Liu, Xinlong Yin:
Cyber (Re-)Insurance Policy Writing Is Np-Hard In Iot Societies. WSC 2021: 1-12 - [i5]Nuh Aydin, Peihan Liu, Bryan Yoshino:
Polycyclic Codes Associated with Trinomials: Good Codes and Open Questions. CoRR abs/2106.12065 (2021) - [i4]Nuh Aydin, Peihan Liu, Bryan Yoshino:
A Database of Quantum Codes. CoRR abs/2108.03567 (2021) - [i3]Arezoo Soufi Karbaski, Taher Abualrub, Nuh Aydin, Peihan Liu:
Additive Polycyclic Codes over F4 Induced by Binary Vectors and Some Optimal Codes. CoRR abs/2108.09198 (2021) - 2020
- [c1]Nuh Aydin, Thomas Guidotti, Peihan Liu:
New Linear Codes as Quasi-Twisted Codes from Long Constacyclic Codes. ACCT 2020: 1-6 - [i2]Nuh Aydin, Thomas Guidotti, Peihan Liu:
New Linear Codes as Quasi-Twisted Codes from Long Constacyclic Codes. CoRR abs/2007.00604 (2020) - [i1]Nuh Aydin, Thomas Guidotti, Peihan Liu:
Good Classical and Quantum Codes from Multi-Twisted Codes. CoRR abs/2008.07037 (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 2025-01-09 13:26 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:
