Sets of binary sequences with small total Hamming distances.
Information Processing Letters（2019）
摘要
The sum of the Hamming distances between pairs of binary sequences in a set is considered. It is shown that this sum is at least 8 and 48 for sets of four and eight sequences, respectively, and is at least (n−1)2 for sets of n sequences where n is not equal to 4 or 8. Sets meeting this minimum are explicitly specified.
更多查看译文
关键词
Combinatorial problems,Binary sequence,Hamming distance
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要