Random Coding Error Exponent for the Bee-Identification Problem

Anshoo Tandon, Vincent Y.F. Tan, Lav R. Varshney

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Consider the problem of identifying a massive number of bees, uniquely labeled with barcodes, using noisy measurements. We introduce this 'bee-identification problem characterize the random coding exponent, and derive efficiently computable bounds for this exponent. We demonstrate that joint decoding of barcodes has much better exponent than separate decoding followed by permutation inference.

Original languageEnglish (US)
Title of host publication2019 IEEE Information Theory Workshop, ITW 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538669006
DOIs
StatePublished - Aug 2019
Event2019 IEEE Information Theory Workshop, ITW 2019 - Visby, Sweden
Duration: Aug 25 2019Aug 28 2019

Publication series

Name2019 IEEE Information Theory Workshop, ITW 2019

Conference

Conference2019 IEEE Information Theory Workshop, ITW 2019
CountrySweden
CityVisby
Period8/25/198/28/19

ASJC Scopus subject areas

  • Software
  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Information Systems

Fingerprint Dive into the research topics of 'Random Coding Error Exponent for the Bee-Identification Problem'. Together they form a unique fingerprint.

Cite this