# Weighing algorithms of classification and identification of situations

@article{Chudnov2015WeighingAO, title={Weighing algorithms of classification and identification of situations}, author={Alexander M. Chudnov}, journal={Discrete Mathematics and Applications}, year={2015}, volume={25}, pages={69 - 81} }

Abstract The paper gives lower bounds for the minimum number m of weighings that are necessary for identification of up to t non-standard objects out of the total number of n objects being tested. For the problem with fixed deviation of weights of non-standard objects we construct a perfect algorithms with parameters n = 11, m = 5, t = 2 corresponding to the parameters of the ternary Virtakallio-Golay code. The nonexistence of a perfect weighing code with such parameters is proved.

## 4 Citations

### Quantum State Identification of Qutrits via a Nonlinear Protocol

- MathematicsJournal of Russian Laser Research
- 2018

We propose a probabilistic quantum protocol to realize a nonlinear transformation of qutrit states, which by iterative applications on ensembles can be used to distinguish two types of pure states.…

### Automatically Solving Deduction Games

- Computer Science
- 2019

We present a technique for automatically solving deduction games in which a player makes repeated queries to a running implementation of the game and receives a game outcome, with the goal of…

### On a metamatemEthical question in talent care

- PhilosophyAnnales Mathematicae et Informaticae
- 2021

Recently more and more ethical issues arise in several sciences. We think that didactics of mathematics is not an exception. In this paper we investigate the question whether we can allow from…

### Counting Counterfeit Coins: A New Coin Weighing Problem

- Mathematics
- 2016

In 2007, a new variety of the well-known problem of identifying a counterfeit coin using a balance scale was introduced in the sixth International Kolmogorov Math Tournament. This paper offers a…

## References

SHOWING 1-7 OF 7 REFERENCES

### The geometry of coin-weighing problems

- Mathematics, Computer ScienceProceedings of 37th Conference on Foundations of Computer Science
- 1996

The authors decide if all the m given coins have the same weight or not using the minimum possible number of weighings in a regular balance beam using linear algebra techniques with geometric probabilistic and combinatorial arguments.

### Optimal Algorithms for the Coin Weighing Problem with a Spring Scale

- Mathematics, Computer ScienceCOLT
- 2009

Suppose we are given n coins out of a collection of coins of two distinct weights w0 and w1, true and counterfeit coins, respectively, where d of them are counterfeit coins. Assume we are allowed to…

### At the Dawn of the Theory of Codes

- Computer Science
- 1993

A series of mathematical stories that form a part of the early history (or the prehistory) of coding theory, that may be still interesting to the mathematical community because they either present a surprising provisional insight or are of exceptional beauty.

### Discrete Convexity

- MathematicsElements of Digital Geometry, Mathematical Morphology, and Discrete Optimization
- 2022

AbstractIn the paper, we explain what subsets of the lattice ℤn and what functions on the lattice ℤn could be called convex. The basis of our theory is the following three main postulates of…

### Discrete convex analysis

- MathematicsMath. Program.
- 1998

This work follows Rockafellar’s conjugate duality approach to convex/nonconvex programs in nonlinear optimization, while technically relying on the fundamental theorems of matroid-theoretic nature.

### Nonbinary Error-Correcting Codes with One-Time Error-Free Feedback

- Computer ScienceProbl. Inf. Transm.
- 2005

We show that, using one-time error-free feedback, it is possible to attain the asymptotic Hamming bound if the number of errors is fixed.

### , “ Addition to D . A . Mikhalina , I . M . Nikonova « One problem on the nding of a false coin ”

- Matematicheskoe prosveshchenie