Author

Hengjia Wei

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Exponentially Larger Deletion-Correcting Codes and Constant-List-Decodable Insertion-Deletion Codes

We establish improved asymptotic rate bounds for adversarial insertion--deletion codes. For binary unique-deletion correction in the linear-deletion regime, we strictly improve Levenshtein's classical lower-bound expression. At deletion fraction $\delta=0.1$, our achievable rate increases from $0.162009$ to $0.194890$,...

Han Mao Kiah, Heng-Jia Wei, Rui-Xiao Zeng · 2 citations

Sep 2026

Constant-List Insertion-Deletion Codes:New Bounds and an Improvement of Levenshtein's Lower Bound

We study codes correcting adversarial insertions and deletions with list size $L$ fixed independently of the block length. We derive new achievable-rate bounds for binary codes and upper bounds over every fixed alphabet of size $q\ge2$, retaining explicit dependence on $L$. We establish a combinatorial reduction that t...

Han Mao Kiah, Heng-Jia Wei, Rui-Xiao Zeng · arXiv.org · 0 citations

Preprint Aug 2026

Moment-based linear programming bounds for locally recoverable codes

New Delsarte-type linear programming bounds for $q$-ary $(r,\delta)$-locally recoverable codes (LRCs) are derived with three attributes: the variable set is comparable in size to that of the classical Delsarte LP, and the convex-hull LP yields improvements not captured by the previous LP and often sharpens the shorteni...

Shu-Jian Li, Hengjia Wei, Mao-Sheng Xiong · 3 citations