访问量:
最后更新时间:--
访问量:
最后更新时间:--
- 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.