Peihan Liu

Orcid: 0000-0003-2403-1517

According to our database1, Peihan Liu authored at least 15 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Convex Relaxation for Solving Large-Margin Classifiers in Hyperbolic Space.
CoRR, 2024

Additive polycyclic codes over $ \mathbb{F}_{4} $ induced by binary vectors and some optimal codes.
Adv. Math. Commun., 2024

2023
Additive polycyclic codes over $\mathbb {\pmb {\varvec{F}}}_{4}$ induced by nonbinary polynomials.
J. Appl. Math. Comput., December, 2023

Skew cyclic codes over $\mathbb {Z}_{4}+u\mathbb {Z}_{4}+v\mathbb {Z}_{4}$.
Cryptogr. Commun., July, 2023

Entanglement-assisted binary quantum codes from skew cyclic codes over ${\mathbb {F}}_2 \times ({\mathbb {F}}_2+v{\mathbb {F}}_2)$.
Quantum Inf. Process., May, 2023

Safeguarding Data in Multimodal AI: A Differentially Private Approach to CLIP Training.
CoRR, 2023

Improving Adversarial Transferability with Scheduled Step Size and Dual Example.
CoRR, 2023

2022
<i>How Hard Is Cyber-risk Management in IT/OT Systems?</i> A Theory to Classify and Conquer Hardness of Insuring ICSs.
ACM Trans. Cyber Phys. Syst., 2022

Polycyclic codes associated with trinomials: good codes and open questions.
Des. Codes Cryptogr., 2022

How Robust is your Fair Model? Exploring the Robustness of Diverse Fairness Strategies.
CoRR, 2022

2021
Additive Polycyclic Codes over F<sub>4</sub> Induced by Binary Vectors and Some Optimal Codes.
CoRR, 2021

A Database of Quantum Codes.
CoRR, 2021

Cyber (Re-)Insurance Policy Writing Is Np-Hard In Iot Societies.
Proceedings of the Winter Simulation Conference, 2021

2020
Good Classical and Quantum Codes from Multi-Twisted Codes.
CoRR, 2020

New Linear Codes as Quasi-Twisted Codes from Long Constacyclic Codes.
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020


  Loading...