3 papers
cs.IT2023
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…
cs.IT2023
Repairing Schemes for Tamo-Barg Codes
Han Cai, Ying Miao, Moshe Schwartz +1
In this paper, the repair problem for erasures beyond locality in locally repairable codes is explored under a practical system setting, where a rack-aware storage system consists…
cs.IT2022
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…