Yang Yaoyu, Chen Zitan
School of Data Science, The Chinese University of Hong Kong, Shenzhen 518172, China.
School of Science and Engineering, Future Networks of Intelligence Institute, The Chinese University of Hong Kong, Shenzhen 518172, China.
Entropy (Basel). 2025 Jan 6;27(1):39. doi: 10.3390/e27010039.
Motivated by studies of data retrieval in polymer-based storage systems, we consider the problem of reconstructing a multiset of binary strings that have the same length and the same weight from the compositions of their prefixes and suffixes of every possible length. We provide necessary and sufficient conditions for which unique reconstruction up to the reversal of the strings is possible. Additionally, we present two algorithms for reconstructing strings from the compositions of prefixes and suffixes of constant-length constant-weight strings.
受基于聚合物的存储系统中数据检索研究的启发，我们考虑从每个可能长度的前缀和后缀的组成来重建具有相同长度和相同权重的二进制字符串多重集的问题。我们提供了在字符串反转的情况下实现唯一重建的充分必要条件。此外，我们提出了两种算法，用于从定长定权字符串的前缀和后缀组成中重建字符串。
