Search for Three Forged Coins

Details Search for Three Forged Coins Search for Three Forged Coins

2000-09-08

arxiv.org/abs/math/0009096v2

Mathematics

Combinatorics

six pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Search for Three Forged Coins does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Search for Three Forged Coins, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search for Three Forged Coins will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-25021