On Constant-Weight Binary B2-Sequences

2023 IEEE International Symposium on Information Theory (ISIT)(2023)

引用 0|浏览0
暂无评分
摘要
Motivated by applications in polymer-based data storage we introduced the new problem of characterizing the code rate and designing constant-weight binary B 2 -sequences. Binary B 2 -sequences are collections of binary strings of length nwith the property that the real-valued sums of all distinct pairs of strings are distinct. In addition to this defining property, constant-weight binary B 2 -sequences also satisfy the constraint that each string has a fixed, relatively small weight ωthat scales linearly with n. The constant-weight constraint ensures low-cost synthesis and uniform processing of the data readout via tandem mass spectrometers. Our main results include upper bounds on the size of the codes formulated as entropy-optimization problems and constructive lower bounds based on Sidon sequences.
更多
查看译文
关键词
binary string collection,code rate,constant-weight binary B2-sequences,constant-weight constraint,constructive lower bounds,data readout processing,entropy-optimization problems,low-cost synthesis,polymer-based data storage,real-valued sums,Sidon sequences,tandem mass spectrometers
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要