访问量：
最后更新时间：--
访问量：
最后更新时间：--
- H. Liu, H. Wei, A. Wachter-Zeh, and M. Schwartz, “Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix and Applications in Multi-Source Network Coding", IEEE Transactions on Information Theory, Early Access, 2024.
- H. Wei and R. Roth, “Multiple-Error-Correcting Codes for Analog Computing on Resistive Crossbars", IEEE Transactions on Information Theory, 70(12), (2024), 8647-8658.
- H. Wei, M. Schwartz and G. Ge, “Reconstruction From Noisy Substrings", IEEE Transactions on Information Theory, 70(11), (2024), 7757-7776.
- H. Wei and M. Schwartz, “Bounds on the Minimum Field Size of Network MDS Codes", IEEE Transactions on Information Theory, 70(8), (2024), 5533–5543.
- X. Yuan, J. Jian, Z. Chai, H. Wei, X. Zhou, Y. Wen, Y. Liu, W. Yan, Y. He, J. F. Zhang, W. Zhang, and T. Min, “Arbitrary Modulation of Average Dwell Time in Discrete-Time Markov Chains based on Tunneling Magnetoresistance Effect", IEEE Electron Device Letters, 45(7), (2024), 1349-1352.
- H. Wei, M, Xu and G. Ge, “Robust Network Function Computation”, IEEE Transactions on Information Theory, 69(11), (2023), 7070–7081.
- H. Wei and M. Schwartz, “Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors", IEEE Transactions on Information Theory, 69(2), (2023), 951–962.
- H. Wei and M. Schwartz, “Sequence Reconstruction for Limited-Magnitude Errors", IEEE Transactions on Information Theory, 68(7), (2022), 4422–4434.
- D. Elimelech, H. Wei and M. Schwartz, “On the Generalized Covering Radii of Reed-Muller Codes", IEEE Transactions on Information Theory, 68(7), (2022), 4378–4391.
- H. Wei, “Nearly Optimal Robust Positioning Patterns", IEEE Transactions on Information Theory, 68(1), (2022), 193-203.
- H. Wei and M. Schwartz, “Improved Coding over Sets for DNA-Based Data Storage", IEEE Transactions on Information Theory, 68(1), (2022), 118-129.
- H. Wei and M. Schwartz, “On Tilings of Asymmetric Limited-Magnitude Balls", European Journal of Combinatorics, 100, (2022).
- H. Wei, X. Wang and M. Schwartz, “On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls", IEEE Transactions on Information Theory, 67(8), (2021), 5104-5115.
- H. Liu, H. Wei, S. Puchinger, A. Wachter-Zeh, and M. Schwartz, “On the Gap between Scalar and Vector Solutions of Generalized Combination Networks", IEEE Transactions on Information Theory, 67(8), (2021), 5580–5591.
- Y. M. Chee, H. M. Kiah, and H. Wei, “Efficient and Explicit Balanced Primer Codes", IEEE Transactions on Information Theory, 66(9), (2020), 5344–5357.
- Y. M. Chee, T. Etzion, H. M. Kiah, A. Vardy, and H. Wei, “Low-Power Cooling Codes with Efficient Encoding and Decoding", IEEE Transactions on Information Theory, 66(8), (2020), 4804–4818.
- Y. M. Chee, D. T. Dao, H. M. Kiah, S. Ling, and H. Wei, “Robust Positioning Patterns with Low Redundancy", SIAM Journal on Computing, 49(2) (2020), 284–317.
- Y. M. Chee, S. Ling, T. T. Nguyen, V. K. Vu, H. Wei, and X. Zhang, “Burst-Deletion-Correcting Codes for Permutations and Multipermutations", IEEE Transactions on Information Theory, 66(2) (2020), 957–969.
- Y. Zhang, X. Wang, H. Wei, and G. Ge, “On Private Information Retrieval Array Codes", IEEE Transactions on Information Theory, 65(9) (2019), 5565–5573.
- H. Wei, G. Ge and C. Colbourn, “Group divisible covering designs with block size four", Journal of Combinatorial Designs, 26(3) (2018), 101–118.
- X. Wang, H. Wei, and G. Ge, “A strengthened inequality of Alon-Babai-Suzuki’s conjecture on set systems with restricted intersections modulo p", Discrete Mathematics, 341(1) (2018), 109–118.
- Y. M. Chee, H. M. Kiah, S. Ling, and H. Wei, “Geometric Orthogonal Codes of Size Larger than Optical Orthogonal Codes", IEEE Transactions on Information Theory, 64(4) (2018), 2883–2895.
- H. Wei and G. Ge, “Directed PBDs with blocks sizes from K where {4} ⊂ K ⊂ {4, . . . , 9}", Journal of Combinatorial Designs, 25 (12) (2017), 535-555.
- H. Wei and G. Ge, “Some more uniformly resolvable designs with block sizes 2 and 4", Discrete Mathematics, 340(9) (2017), 2243–2249.
- S. Li, H. Wei, and G. Ge, “Generic constructions for partitioned difference families with applications: a unified combinatorial approach", Designs, Codes and Cryptography, 82(3) (2017), 583–599.
- X. Wang, H. Wei, C. Shangguan, and G. Ge, “New bounds and constructions for multiply constant-weight codes", IEEE Transactions on Information Theory, 62(11)(2016), 6315–6327.
- G. Ge, S. Li, and H. Wei, “A new construction of group divisible designs with non-uniform group type", Journal of Combinatorial Designs, 24(8) (2016), 369–382.
- H. Wei and G. Ge, “Uniformly resolvable designs with block sizes 3 and 4", Discrete Mathematics, 339(3) (2016), 1069–1085.
- H. Wei, G. Ge, and C. Colbourn, “The existence of well balanced triple systems", Journal of Combinatorial Designs, 24(2) (2016), 77–100.
- G. Ge, E. Kolotoğlu, and H. Wei, “Optimal groomings with grooming ratios six and seven", Journal of Combinatorial Designs, 23(9) (2015), 400–415.
- H. Wei, H. Zhang, M. Zhu, and G. Ge, “Optimal ternary constant-composition codes with weight four and distance six", Discrete Mathematics, 338(3) (2015), 72–87.
- G. Ge, S. Hu, E. Kolotoğlu, and H. Wei, “A complete solution to spectrum problem for five-vertex graphs with application to traffic grooming in optical networks", Journal of Combinatorial Designs, 23(6) (2015), 233–273.
- H. Wei, H. Zhang, and G. Ge, “Completely reducible super-simple designs with block size five and index two", Designs, Codes and Cryptography, 76(3) (2015), 589–600.
- H. Wei and G. Ge, “Spectrum of sizes for perfect 2-deletion-correcting codes of length 4", Designs, Codes and Cryptography, 74(1) (2015), 127–151.
- H. Wei and G. Ge, “Group divisible designs with block size four and group type gum1", Designs, Codes and Cryptography, 74(1) (2015), 243–282.
- H. Wei and G. Ge, “Group divisible designs with block size four and group type gum1 for g ≡ 0 mod 6", Journal of Combinatorial Designs, 22(1) (2014), 26–52.
- H. Wei and G. Ge, “Kirkman frames having hole type hum1 for h ≡ 0 mod 12", Designs, Codes and Cryptography, 72(3) (2014), 497–510.
- H. Wei and G. Ge, “Group divisible designs with block sizes from K1(3) and Kirkman frames of type hum1", Discrete Mathematics, 329 (2014), 42–68.
- H. Wei and G. Ge, “Some more 5-GDDs, 4-frames and 4-RGDDs", Discrete Mathematics, 336 (2014), 7–21.
- H. Wei and G. Ge, “Group divisible designs with block size four and group type gum1 for more small g", Discrete Mathematics, 313(20) (2013), 2065–2083.
- H. Liu, H. Wei, A. Wachter-Zeh, and M. Schwartz, “Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix", Proceedings of the 2023 IEEE Information Theory Workshop (ITW), Saint-Malo, France.
- H. Wei and M. Schwartz, “Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors", Proceedings of the 2022 IEEE International Symposium on Information Theory (ISIT), Espoo, Finland, pp. 49–54.
- D. Elimelech, H. Wei, and M. Schwartz„ “On the Generalized Covering Radii of Reed-Muller Codes", Proceedings of the 2022 IEEE International Symposium on Information Theory (ISIT), Espoo, Finland, pp. 1791–1796.
- H. Wei and M. Schwartz, “On Tilings of Asymmetric Limited-Magnitude Balls", Proceedings of the 2020 IEEE Information Theory Workshop (ITW), Riva del Garda, Italy, pp. 530–534.
- H. Liu, H. Wei, S. Puchinger, A. Wachter-Zeh, and M. Schwartz, “On the Gap between Scalar and Vector Solutions of Generalized Combination Networks", Proceedings of the 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, pp. 1646–1651.
- D. T. Dao, H. M. Kiah, and H. Wei, “Maximum Length of Robust Positioning Sequences", Proceedings of the 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, pp. 108–113.
- Y. M. Chee, H. M. Kiah, and H. Wei, “Efficient and Explicit Balanced Primer Codes", Proceedings of the 2019 IEEE International Symposium on Information Theory (ISIT), Paris, pp. 91–95.
- Y. M. Chee, D. T. Dao, H. M. Kiah, S. Ling, and H. Wei, “Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms", Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019, San Diego, pp. 2171–2184.
- Y. M. Chee, T. Etzion, H. M. Kiah, A. Vardy, and H. Wei, “Low-Power Cooling Codes with Efficient Encoding and Decoding", Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT), Vail, pp. 1655–1659.
- Y. M. Chee, H. M. Kiah, S. Ling, and H. Wei, “Geometric orthogonal codes better than optical orthogonal codes", Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, pp. 1396–1400.
- Y. M. Chee, S. Ling, T. T. Nguyen, V. K. Vu, and H. Wei, “Permutation codes correcting a single burst deletion II: stable deletions", Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, pp. 2688–2692.
