20 citations · 37 across the 20 of their papers we have counts for
20 papers
Moment-based linear programming bounds for locally recoverable codes
Shujian Li, Hengjia Wei, Maosheng Xiong
In this paper we derive new Delsarte-type linear programming bounds for -ary -locally recoverable codes (LRCs) with three attributes: first, the variable set is comparabl…
Linear Network Coding for Robust Function Computation and Its Applications in Distributed Computing
Hengjia Wei, Min Xu, Gennian Ge
We investigate linear network coding in the context of robust function computation, where a sink node is tasked with computing a target function of messages generated at multiple s…
Combinatorial alphabet-dependent bounds for insdel codes
Xiangliang Kong, Itzhak Tamo, Hengjia Wei
Error-correcting codes resilient to synchronization errors such as insertions and deletions are known as insdel codes. Due to their important applications in DNA storage and comput…
Multiple-Error-Correcting Codes for Analog Computing on Resistive Crossbars
Hengjia Wei, Ron M. Roth
Error-correcting codes over the real field are studied which can locate outlying computational errors when performing approximate computing of real vector--matrix multiplication on…
Reconstruction from Noisy Substrings
Hengjia Wei, Moshe Schwartz, Gennian Ge
This paper studies the problem of encoding messages into sequences which can be uniquely recovered from some noisy observations about their substrings. The observed reads comprise…
Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix and Applications in Multi-Source Network Coding
Hedongliang Liu, Hengjia Wei, Antonia Wachter-Zeh +1
Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric and therefore are known as maximum sum-r…
Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors
Hengjia Wei, Moshe Schwartz
Motivated by applications to DNA-storage, flash memory, and magnetic recording, we study perfect burst-correcting codes for the limited-magnitude error channel. These codes are lat…
Sequence Reconstruction for Limited-Magnitude Errors
Hengjia Wei, Moshe Schwartz
Motivated by applications to DNA storage, we study reconstruction and list-reconstruction schemes for integer vectors that suffer from limited-magnitude errors. We characterize the…
On the Generalized Covering Radii of Reed-Muller Codes
Dor Elimelech, Hengjia Wei, Moshe Schwartz
We study generalized covering radii, a fundamental property of linear codes that characterizes the trade-off between storage, latency, and access in linear data-query protocols suc…
Improved Coding over Sets for DNA-Based Data Storage
Hengjia Wei, Moshe Schwartz
Error-correcting codes over sets, with applications to DNA storage, are studied. The DNA-storage channel receives a set of sequences, and produces a corrupted version of the set, i…
On the Gap between Scalar and Vector Solutions of Generalized Combination Networks
Hedongliang Liu, Hengjia Wei, Sven Puchinger +2
We study scalar-linear and vector-linear solutions of the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer,…
On Tilings of Asymmetric Limited-Magnitude Balls
Hengjia Wei, Moshe Schwartz
We study whether an asymmetric limited-magnitude ball may tile . This ball generalizes previously studied shapes: crosses, semi-crosses, and quasi-crosses. Such tilin…
On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls
Hengjia Wei, Xin Wang, Moshe Schwartz
We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space…
On the Gap between Scalar and Vector Solutions of Generalized Combination Networks
Hedongliang Liu, Hengjia Wei, Sven Puchinger +2
We study scalar-linear and vector-linear solutions to the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer,…
Robust Positioning Patterns with Low Redundancy
Yeow Meng Chee, Duc Tu Dao, Han Mao Kiah +2
A robust positioning pattern is a large array that allows a mobile device to locate its position by reading a possibly corrupted small window around it. In this paper, we provide c…
Efficient and Explicit Balanced Primer Codes
Yeow Meng Chee, Han Mao Kiah, Hengjia Wei
To equip DNA-based data storage with random-access capabilities, Yazdi et al. (2018) prepended DNA strands with specially chosen address sequences called primers and provided certa…
A strengthened inequality of Alon-Babai-Suzuki's conjecture on set systems with restricted intersections modulo p
Xin Wang, Hengjia Wei, Gennian Ge
Let and be disjoint subsets of , where is a prime and be a family of subset…
On private information retrieval array codes
Yiwei Zhang, Xin Wang, Hengjia Wei +1
Given a database, the private information retrieval (PIR) protocol allows a user to make queries to several servers and retrieve a certain item of the database via the feedbacks, w…
New bounds and constructions for multiply constant-weight codes
Xin Wang, Hengjia Wei, Chong Shangguan +1
Multiply constant-weight codes (MCWCs) were introduced recently to improve the reliability of certain physically unclonable function response. In this paper, the bounds of MCWCs an…
Optimal Ternary Constant-Composition Codes with Weight Four and Distance Six
Wei Hengjia, Zhang Hui, Zhu Mingzhi +1
The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role i…