On the Bee-Identification Error Exponent with Absentee Bees

10/23/2019
by   Anshoo Tandon, et al.
0

The "bee-identification problem" was formally defined by Tandon, Tan and Varshney [IEEE Trans. Commun. (2019) [Online early access]], and the error exponent was studied. This work extends the results for the "absentee bees" scenario, where a small fraction of the bees are absent in the beehive image used for identification. For this setting, we present an exact characterization of the bee-identification error exponent, and show that independent barcode decoding is optimal, i.e., joint decoding of the bee barcodes does not result in a better error exponent relative to independent decoding of each noisy barcode. This is in contrast to the result without absentee bees, where joint barcode decoding results in a significantly higher error exponent than independent barcode decoding. We also define and characterize the "capacity" for the bee-identification problem with absentee bees, and prove the strong converse for the same.

READ FULL TEXT
research
05/20/2019

Error Exponent Bounds for the Bee-Identification Problem

Consider the problem of identifying a massive number of bees, uniquely l...
research
12/20/2022

Efficient Algorithms for the Bee-Identification Problem

The bee-identification problem, formally defined by Tandon, Tan and Vars...
research
08/08/2022

Towards Weak Information Theory: Weak-Joint Typicality Decoding Using Support Vector Machines May Lead to Improved Error Exponents

In this paper, the authors report a way to use concepts from statistical...
research
07/22/2023

A Refinement of Expurgation

We show that with probability that tends to 1 with the code length, expu...
research
01/16/2020

Proof of Convergence for Correct-Decoding Exponent Computation

For a discrete memoryless channel with finite input and output alphabets...
research
08/19/2019

Computation of the largest Lyapunov exponent using recursive estimation with variable factor

Chaotic systems have been investigated in the most diverse areas. One of...
research
05/12/2022

A Family of Algorithms for Computing Information-Theoretic Forms of Strong Converse Exponents in Channel Coding and Lossy Source Coding

This paper studies the computation of error and correct decoding probabi...

Please sign up or login with your details

Forgot password? Click here to reset