Hao Chen

Orcid: 0000-0002-4558-8982

Affiliations:
  • Jinan University, College of Information Science and Technology / College of Cyber Security, Guangzhou, China
  • Hangzhou Dianzi University, School of Sciences, China
  • Fudan University, Institute of Mathematics, Shanghai, China (PhD 1991)


According to our database1, Hao Chen authored at least 46 papers between 2005 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Lattice codes for lattice-based PKE.
Des. Codes Cryptogr., April, 2024

2023
New Explicit Good Linear Sum-Rank-Metric Codes.
IEEE Trans. Inf. Theory, October, 2023

New MDS entanglement-assisted quantum codes from MDS Hermitian self-orthogonal codes.
Des. Codes Cryptogr., August, 2023

New Constant Dimension Subspace Codes From the Mixed Dimension Construction.
IEEE Trans. Inf. Theory, July, 2023

A characterization of optimal locally repairable codes.
Discret. Math., July, 2023

Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes.
IEEE Trans. Inf. Theory, May, 2023

On the Hull-Variation Problem of Equivalent Linear Codes.
IEEE Trans. Inf. Theory, May, 2023

New upper bounds and constructions of multi-erasure locally recoverable codes.
Cryptogr. Commun., May, 2023

New Euclidean and Hermitian Self-Dual Cyclic Codes with Square-Root-Like Minimum Distances.
CoRR, 2023

New Binary Self-Dual Cyclic Codes with Square-Root-Like Minimum Distances.
CoRR, 2023

2022
Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes.
IEEE Trans. Inf. Theory, 2022

Better Lattice Quantizers Constructed From Complex Integers.
IEEE Trans. Commun., 2022

Lattice Codes for Lattice-Based PKE.
IACR Cryptol. ePrint Arch., 2022

New Non-Equivalent (Self-Dual) MDS Codes From Elliptic Curves.
CoRR, 2022

Generalized Singleton Type Upper Bounds.
CoRR, 2022

MDS Entanglement-Assisted Quantum Codes of Arbitrary Lengths and Arbitrary Distances.
CoRR, 2022

Storage and Retrieval Codes in PIR Schemes with Colluding Servers.
CoRR, 2022

Star Product PIR Schemes with Colluding Servers over Small Fields.
CoRR, 2022

Linear MSRD codes with Various Matrix Sizes and Unrestricted Lengths.
CoRR, 2022

Better Lattice Quantizers Constructed from Complex Integers.
CoRR, 2022

New constant dimension subspace codes from block inserting constructions.
Cryptogr. Commun., 2022

Generalized hamming weights of linear codes from cryptographic functions.
Adv. Math. Commun., 2022

An algorithm for generalized syndrome decoding problem.
Adv. Math. Commun., 2022

2021
Long Optimal and Small-Defect LRC Codes With Unbounded Minimum Distances.
IEEE Trans. Inf. Theory, 2021

The Maiorana-McFarland structure based cryptanalysis for Simon.
IACR Cryptol. ePrint Arch., 2021

Ring-LWE over two-to-power cyclotomics is not hard.
IACR Cryptol. ePrint Arch., 2021

List-decodable Codes and Covering Codes.
CoRR, 2021

Explicit Good Subspace-metric and Subset-metric Codes as Insertion-deletion Codes.
CoRR, 2021

Support Constrained Generator Matrices and the Generalized Hamming Weights.
CoRR, 2021

Strong Singleton type upper bounds for linear insertion-deletion codes.
CoRR, 2021

Finding small solutions of the equation $ \mathit{{Bx-Ay = z}} $ and its applications to cryptanalysis of the RSA cryptosystem.
Adv. Math. Commun., 2021

2020
New Constructions of Subspace Codes Using Subsets of MRD Codes in Several Blocks.
IEEE Trans. Inf. Theory, 2020

Sublattice Attacks on Ring-LWE with Wide Error Distributions I.
IACR Cryptol. ePrint Arch., 2020

On a conjecture about a class of permutation quadrinomials.
Finite Fields Their Appl., 2020

Parameter-controlled inserting constructions of constant dimension subspace codes.
CoRR, 2020

2019
Solving Ring-LWE over Algebraic Integer Rings.
IACR Cryptol. ePrint Arch., 2019

Long Optimal or Small-Defect LRC Codes with Unbounded Minimum Distances.
CoRR, 2019

2018
New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes.
IEEE Trans. Inf. Theory, 2018

2017
New explicit binary constant weight codes from Reed-Solomon codes.
Finite Fields Their Appl., 2017

2016
New <i>q</i>-ary quantum MDS codes with distances bigger than q/2.
Quantum Inf. Process., 2016

A Measure Version of Gaussian Heuristic.
IACR Cryptol. ePrint Arch., 2016

2015
Deterministic Construction of RIP Matrices in Compressed Sensing from Constant Weight Codes.
CoRR, 2015

New q-ary Quantum MDS Codes with Distances Bigger than q/2.
CoRR, 2015

Explicit RIP Matrices in Compressed Sensing from Algebraic Geometry.
CoRR, 2015

Explicit Binary Constant Weight Codes from Algebraic Geometric Codes.
CoRR, 2015

2005
On the binary sequences with high GF(2) linear complexities and low GF(p) linear complexities.
IACR Cryptol. ePrint Arch., 2005


  Loading...