寻找三枚伪造的硬币
Search for Three Forged Coins
摘要:
假设我们有一组t枚硬币,它们看起来是一样的,但已知其中s枚是假币,重量与其他硬币不同。我们的问题是通过对t枚硬币的子集进行称重来定位假币,尽可能少地称重。尽管有大量的文献对这个问题,它仍然是开放的s>2。在本文中,我们给出了一个有效的顺序加权算法的情况下,s=3,平均1.75加权每比特的t,因为t接近无穷大。(It众所周知,任何算法都必须具有每位超过1.5次加权。)我们使用我们的算法给出了一个有效的信道编码的三发送端多址加法器信道的反馈。
英文摘要:
Suppose we are given a set of t coins which look identical, but a known number s of them are counterfeit, with a known weight different from the others. Our problem is to locate the counterfeits by weighing subsets of the t coins, with as few weighings as possible. Despite a large literature on this problem, it remains wide open for s>2. In this paper, we give an efficient sequential weighing algorithm for the case s=3, with an average of 1.75 weighings per bit of t, as t approaches infinity. (It is known that any algorithm must have more than 1.5 weighings per bit.) We use our algorithm to give an efficient channel coding for the three-sender multiple-access adder channel with feedback.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。