Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Query Matrices for Retrieving Binary Vectors Based on the Hamming
  Distance Oracle   The Hamming oracle returns the Hamming distance between an unknown binary
$n$-vector $x$ and a binary query $n$-vector y. The objective is to determine
$x$ uniquely using a sequence of $m$ queries. What are the minimum number of
queries required in the worst case? We consider the query ratio $m/n$ to be our
figure of merit and derive upper bounds on the query ratio by explicitly
constructing $(m,n)$ query matrices. We show that our recursive and algebraic
construction results in query ratios arbitrarily close to zero. Our
construction is based on codes of constant weight. A decoding algorithm for
recovering the unknown binary vector is also described.

37
The categories of this paper are: supr-con
12
The categories of this paper are: nucl-th
33
The categories of this paper are: plasm-ph
28
The categories of this paper are: alg-geom
19
The categories of this paper are: eess
31
The categories of this paper are: ao-sci
14
The categories of this paper are: math-ph
36
The categories of this paper are: cmp-lg
11
The categories of this paper are: hep-lat
20
The categories of this paper are: acc-phys
29
The categories of this paper are: funct-an
21
The categories of this paper are: adap-org
6
The categories of this paper are: astro-ph
0
The categories of this paper are: hep-ph
35
The categories of this paper are: mtrl-th
7
The categories of this paper are: hep-th