Efficient Algorithms for the Bee-Identification Problem

by   Han Mao Kiah, et al.

The bee-identification problem, formally defined by Tandon, Tan and Varshney (2019), requires the receiver to identify "bees" using a set of unordered noisy measurements. In this previous work, Tandon, Tan, and Varshney studied error exponents and showed that decoding the measurements jointly results in a significantly smaller error exponent. In this work, we study algorithms related to this joint decoder. First, we demonstrate how to perform joint decoding efficiently. By reducing to the problem of finding perfect matching and minimum-cost matchings, we obtain joint decoders that run in time quadratic and cubic in the number of "bees" for the binary erasure (BEC) and binary symmetric channels (BSC), respectively. Next, by studying the matching algorithms in the context of channel coding, we further reduce the running times by using classical tools like peeling decoders and list-decoders. In particular, we show that our identifier algorithms when used with Reed-Muller codes terminate in almost linear and quadratic time for BEC and BSC, respectively. Finally, for explicit codebooks, we study when these joint decoders fail to identify the "bees" correctly. Specifically, we provide practical methods of estimating the probability of erroneous identification for given codebooks.


page 1

page 2

page 3

page 4


On the Bee-Identification Error Exponent with Absentee Bees

The "bee-identification problem" was formally defined by Tandon, Tan and...

Error Exponent Bounds for the Bee-Identification Problem

Consider the problem of identifying a massive number of bees, uniquely l...

Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time

In the long-studied problem of combinatorial group testing, one is asked...

Recursive projection-aggregation decoding of Reed-Muller codes

We propose a new class of efficient decoding algorithms for Reed-Muller ...

Tightness of the Asymptotic Generalized Poor-Verdú Error Bound for the Memoryless Symmetric Channel

The generalized Poor-Verdú error lower bound for multihypothesis testing...

Input-distribution-aware parallel decoding of block codes

Many channel decoders rely on parallel decoding attempts to achieve good...

Rate of Prefix-free Codes in LQG Control Systems with Side Information

In this work, we study an LQG control system where one of two feedback c...

Please sign up or login with your details

Forgot password? Click here to reset