A Simple and Efficient Strategy for the Coin Weighing Problem with a Spring Scale

05/08/2018
by   Esmaeil Karimi, et al.
0

This paper considers a generalized version of the coin weighing problem with a spring scale that lies at the intersection of group testing and compressed sensing problems. Given a collection of n≥ 2 coins of total weight d (for a known integer d), where the weight of each coin is an unknown integer in the range of {0,1,...,k} (for a known integer k≥ 1), the problem is to determine the weight of each coin by weighing subsets of coins in a spring scale. The goal is to minimize the average number of weighings over all possible weight configurations. For d=k=1, an adaptive bisecting weighing strategy is known to be optimal. However, even the case of d=k=2, which is the simplest non-trivial case of the problem, is still open. For this case, we propose and analyze a simple and effective adaptive weighing strategy. A numerical evaluation of the exact recursive formulas, derived for the analysis of the proposed strategy, shows that this strategy requires about 1.365_2 n -0.5 weighings on average. To the best of our knowledge, this is the first non-trivial achievable upper bound on the minimum expected required number of weighings for the case of d=k=2. As n grows unbounded, the proposed strategy, when compared to an optimal strategy within the commonly-used class of nested strategies, requires about 31.75% less number of weighings on average; and in comparison with the information-theoretic lower bound, it requires at most about 8.16% extra number of weighings on average.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/27/2023

On Detecting Some Defective Items in Group Testing

Group testing is an approach aimed at identifying up to d defective item...
research
12/15/2017

Improved Target Acquisition Rates with Feedback Codes

This paper considers the problem of acquiring an unknown target location...
research
01/08/2018

Novel Impossibility Results for Group-Testing

In this work we prove non-trivial impossibility results for perhaps the ...
research
05/23/2019

On the Average Case of MergeInsertion

MergeInsertion, also known as the Ford-Johnson algorithm, is a sorting a...
research
02/04/2019

(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing

Consider a kidney-exchange application where we want to find a max-match...
research
01/10/2021

An introduction to the Kepler-Heisenberg problem

Here we provide an overview of what is known, and what is not known, abo...
research
05/27/2020

Group testing with nested pools

We iterate Dorfman's pool testing algorithm <cit.> to identify infected ...

Please sign up or login with your details

Forgot password? Click here to reset