default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHengjia Wei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Hengjia Wei
, Moshe Schwartz:
Bounds on the Minimum Field Size of Network MDS Codes. IEEE Trans. Inf. Theory 70(8): 5533-5543 (2024)- [i19]Hengjia Wei, Ron M. Roth:
Multiple-Error-Correcting Codes for Analog Computing on Resistive Crossbars. CoRR abs/2402.13503 (2024) - [i18]Xiangliang Kong, Itzhak Tamo, Hengjia Wei:
Combinatorial alphabet-dependent bounds for insdel codes. CoRR abs/2408.10961 (2024) - [i17]Hengjia Wei, Min Xu, Gennian Ge:
Linear Network Coding for Robust Function Computation and Its Applications in Distributed Computing. CoRR abs/2409.10854 (2024) - 2023
- [j28]Hengjia Wei, Moshe Schwartz:
Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors. IEEE Trans. Inf. Theory 69(2): 951-962 (2023) - [j27]Hengjia Wei, Min Xu, Gennian Ge:
Robust Network Function Computation. IEEE Trans. Inf. Theory 69(11): 7070-7081 (2023) - [c11]Hedongliang Liu, Hengjia Wei, Antonia Wachter-Zeh, Moshe Schwartz:
Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix. ITW 2023: 7-12 - [i16]Hengjia Wei, Moshe Schwartz, Gennian Ge:
Reconstruction from Noisy Substrings. CoRR abs/2312.04790 (2023) - 2022
- [j26]Hengjia Wei, Moshe Schwartz:
On tilings of asymmetric limited-magnitude balls. Eur. J. Comb. 100: 103450 (2022) - [j25]Hengjia Wei, Moshe Schwartz:
Improved Coding Over Sets for DNA-Based Data Storage. IEEE Trans. Inf. Theory 68(1): 118-129 (2022) - [j24]Hengjia Wei:
Nearly Optimal Robust Positioning Patterns. IEEE Trans. Inf. Theory 68(1): 193-203 (2022) - [j23]Dor Elimelech, Hengjia Wei, Moshe Schwartz:
On the Generalized Covering Radii of Reed-Muller Codes. IEEE Trans. Inf. Theory 68(7): 4378-4391 (2022) - [j22]Hengjia Wei, Moshe Schwartz:
Sequence Reconstruction for Limited-Magnitude Errors. IEEE Trans. Inf. Theory 68(7): 4422-4434 (2022) - [c10]Dor Elimelech, Hengjia Wei, Moshe Schwartz:
On the Generalized Covering Radii of Reed-Muller Codes. ISIT 2022: 1749-1754 - [c9]Hengjia Wei, Moshe Schwartz:
Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors. ISIT 2022: 1809-1814 - [i15]Hengjia Wei, Moshe Schwartz:
Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors. CoRR abs/2201.01558 (2022) - [i14]Hedongliang Liu, Hengjia Wei, Antonia Wachter-Zeh, Moshe Schwartz:
Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix. CoRR abs/2212.07991 (2022) - 2021
- [j21]Hengjia Wei, Xin Wang, Moshe Schwartz:
On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls. IEEE Trans. Inf. Theory 67(8): 5104-5115 (2021) - [j20]Hedongliang Liu, Hengjia Wei, Sven Puchinger, Antonia Wachter-Zeh, Moshe Schwartz:
On the Gap Between Scalar and Vector Solutions of Generalized Combination Networks. IEEE Trans. Inf. Theory 67(8): 5580-5591 (2021) - [i13]Dor Elimelech, Hengjia Wei, Moshe Schwartz:
On the Generalized Covering Radii of Reed-Muller Codes. CoRR abs/2107.09902 (2021) - [i12]Hengjia Wei, Moshe Schwartz:
Sequence Reconstruction for Limited-Magnitude Errors. CoRR abs/2108.09662 (2021) - 2020
- [j19]Yeow Meng Chee, Duc Tu Dao, Han Mao Kiah, San Ling, Hengjia Wei:
Robust Positioning Patterns with Low Redundancy. SIAM J. Comput. 49(2): 284-317 (2020) - [j18]Yeow Meng Chee, San Ling, Tuan Thanh Nguyen, Van Khu Vu, Hengjia Wei, Xiande Zhang:
Burst-Deletion-Correcting Codes for Permutations and Multipermutations. IEEE Trans. Inf. Theory 66(2): 957-969 (2020) - [j17]Yeow Meng Chee, Tuvi Etzion, Han Mao Kiah, Alexander Vardy, Hengjia Wei:
Low-Power Cooling Codes With Efficient Encoding and Decoding. IEEE Trans. Inf. Theory 66(8): 4804-4818 (2020) - [j16]Yeow Meng Chee, Han Mao Kiah, Hengjia Wei:
Efficient and Explicit Balanced Primer Codes. IEEE Trans. Inf. Theory 66(9): 5344-5357 (2020) - [c8]Duc Tu Dao, Han Mao Kiah, Hengjia Wei:
Maximum Length of Robust Positioning Sequences. ISIT 2020: 108-113 - [c7]Hedongliang Liu, Hengjia Wei, Sven Puchinger, Antonia Wachter-Zeh, Moshe Schwartz:
On the Gap between Scalar and Vector Solutions of Generalized Combination Networks. ISIT 2020: 1646-1651 - [c6]Hengjia Wei, Moshe Schwartz:
On Tilings of Asymmetric Limited-Magnitude Balls. ITW 2020: 1-5 - [i11]Hedongliang Liu, Hengjia Wei, Sven Puchinger, Antonia Wachter-Zeh, Moshe Schwartz:
On the Gap between Scalar and Vector Solutions of Generalized Combination Networks. CoRR abs/2001.04150 (2020) - [i10]Hengjia Wei, Xin Wang, Moshe Schwartz:
On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls. CoRR abs/2005.14519 (2020) - [i9]Hengjia Wei, Moshe Schwartz:
On Tilings of Asymmetric Limited-Magnitude Balls. CoRR abs/2006.00198 (2020) - [i8]Hedongliang Liu, Hengjia Wei, Sven Puchinger, Antonia Wachter-Zeh, Moshe Schwartz:
On the Gap between Scalar and Vector Solutions of Generalized Combination Networks. CoRR abs/2006.04870 (2020) - [i7]Hengjia Wei, Moshe Schwartz:
Improved Coding over Sets for DNA-Based Data Storage. CoRR abs/2009.08816 (2020)
2010 – 2019
- 2019
- [j15]Yiwei Zhang, Xin Wang, Hengjia Wei, Gennian Ge:
On Private Information Retrieval Array Codes. IEEE Trans. Inf. Theory 65(9): 5565-5573 (2019) - [c5]Yeow Meng Chee, Han Mao Kiah, Hengjia Wei:
Efficient and Explicit Balanced Primer Codes. ISIT 2019: 91-95 - [c4]Yeow Meng Chee, Duc Tu Dao, Han Mao Kiah, San Ling, Hengjia Wei:
Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms. SODA 2019: 2171-2184 - [i6]Yeow Meng Chee, Han Mao Kiah, Hengjia Wei:
Efficient and Explicit Balanced Primer Codes. CoRR abs/1901.01023 (2019) - [i5]Yeow Meng Chee, Duc Tu Dao, Han Mao Kiah, San Ling, Hengjia Wei:
Robust Positioning Patterns with Low Redundancy. CoRR abs/1912.13301 (2019) - 2018
- [j14]Xin Wang, Hengjia Wei, Gennian Ge:
A strengthened inequality of Alon-Babai-Suzuki's conjecture on set systems with restricted intersections modulo p. Discret. Math. 341(1): 109-118 (2018) - [j13]Yeow Meng Chee, Han Mao Kiah, San Ling, Hengjia Wei:
Geometric Orthogonal Codes of Size Larger Than Optical Orthogonal Codes. IEEE Trans. Inf. Theory 64(4): 2883-2895 (2018) - [c3]Yeow Meng Chee, Tuvi Etzion, Han Mao Kiah, Alexander Vardy, Hengjia Wei:
Low-Power Cooling Codes with Efficient Encoding and Decoding. ISIT 2018: 1655-1659 - [i4]Yeow Meng Chee, Tuvi Etzion, Han Mao Kiah, Alexander Vardy, Hengjia Wei:
Low-Power Cooling Codes with Efficient Encoding and Decoding. CoRR abs/1808.09535 (2018) - 2017
- [j12]Shuxing Li, Hengjia Wei, Gennian Ge:
Generic constructions for partitioned difference families with applications: a unified combinatorial approach. Des. Codes Cryptogr. 82(3): 583-599 (2017) - [j11]Hengjia Wei, Gennian Ge:
Some more uniformly resolvable designs with block sizes 2 and 4. Discret. Math. 340(9): 2243-2249 (2017) - [c2]Yeow Meng Chee, Han Mao Kiah, San Ling, Hengjia Wei:
Geometric orthogonal codes better than optical orthogonal codes. ISIT 2017: 1396-1400 - [c1]Yeow Meng Chee, San Ling, Tuan Thanh Nguyen, Van Khu Vu, Hengjia Wei:
Permutation codes correcting a single burst deletion II: Stable deletions. ISIT 2017: 2688-2692 - 2016
- [j10]Hengjia Wei, Gennian Ge:
Uniformly resolvable designs with block sizes 3 and 4. Discret. Math. 339(3): 1069-1085 (2016) - [j9]Xin Wang, Hengjia Wei, Chong Shangguan, Gennian Ge:
New Bounds and Constructions for Multiply Constant-Weight Codes. IEEE Trans. Inf. Theory 62(11): 6315-6327 (2016) - [i3]Yiwei Zhang, Xin Wang, Hengjia Wei, Gennian Ge:
On private information retrieval array codes. CoRR abs/1609.09167 (2016) - 2015
- [j8]Hengjia Wei, Gennian Ge:
Spectrum of sizes for perfect 2-deletion-correcting codes of length 4. Des. Codes Cryptogr. 74(1): 127-151 (2015) - [j7]Hengjia Wei, Gennian Ge:
Group divisible designs with block size four and group type gum1. Des. Codes Cryptogr. 74(1): 243-282 (2015) - [j6]Hengjia Wei, Hui Zhang, Gennian Ge:
Completely reducible super-simple designs with block size five and index two. Des. Codes Cryptogr. 76(3): 589-600 (2015) - [j5]Hengjia Wei, Hui Zhang, Mingzhi Zhu, Gennian Ge:
Optimal ternary constant-composition codes with weight four and distance six. Discret. Math. 338(3): 72-87 (2015) - [i2]Xin Wang, Hengjia Wei, Chong Shangguan, Gennian Ge:
New bounds and constructions for multiply constant-weight codes. CoRR abs/1512.08220 (2015) - 2014
- [j4]Hengjia Wei, Gennian Ge:
Kirkman frames having hole type $$h^{u} m^{1}$$ for $$h \equiv 0 {\, \, \mathrm{mod}\, 12}\, $$. Des. Codes Cryptogr. 72(3): 497-510 (2014) - [j3]Hengjia Wei, Gennian Ge:
Group divisible designs with block sizes from Kl(3) and Kirkman frames of type huml. Discret. Math. 329: 42-68 (2014) - [j2]Hengjia Wei, Gennian Ge:
Some more 5-GDDs, 4-frames and 4-RGDDs. Discret. Math. 336: 7-21 (2014) - [i1]Hengjia Wei, Hui Zhang, Mingzhi Zhu, Gennian Ge:
Optimal Ternary Constant-Composition Codes with Weight Four and Distance Six. CoRR abs/1409.6092 (2014) - 2013
- [j1]Hengjia Wei, Gennian Ge:
Group divisible designs with block size four and group type gum1gum1 for more small gg. Discret. Math. 313(20): 2065-2083 (2013)
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 2024-10-15 21:37 CEST 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:
