R&D: Improved Coding Over Sets for DNA-Based Storage
New bounds on code parameters are provided, which improve upon known bounds; new codes are constructed, at times matching bounds up to lower-order terms or small constant factors.
This is a Press Release edited by StorageNewsletter.com on March 8, 2022 at 2:01 pmIEEE Transactions on Information Theory has published an article written by Hengjia Wei, and Moshe Schwartz, School of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beer Sheva, Israel.
Abstract: “Error-correcting codes over sets, with applications to DNA storage, are studied. The DNA-storage channel receives a set of sequences, and produces a corrupted version of the set, including sequence loss, symbol substitution, symbol insertion/deletion, and limited-magnitude errors in symbols. Various parameter regimes are studied. New bounds on code parameters are provided, which improve upon known bounds. New codes are constructed, at times matching the bounds up to lower-order terms or small constant factors.“