Codeword or noise? Exact random coding exponents for slotted asynchronism

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We consider the problem of slotted asynchronous ccoded communication, where in each time frame (slot), the ctransmitter is either silent or transmits a codeword from a given c(randomly selected) codebook. The task of the decoder is to decide cwhether transmission has taken place, and if so, to decode the cmessage. We derive the optimum detection/decoding rule in the csense of the best trade-off among the probabilities of decoding cerror, false alarm, and misdetection. For this detection/decoding crule, we then derive single-letter characterizations of the exact cexponential rates of these three probabilities for the average code cin the ensemble. It is shown that previously suggested decoders care in general strictly sub-optimal.

Original languageEnglish
Title of host publication2014 IEEE International Symposium on Information Theory, ISIT 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2509-2513
Number of pages5
ISBN (Print)9781479951864
DOIs
StatePublished - 2014
Event2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States
Duration: 29 Jun 20144 Jul 2014

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Conference

Conference2014 IEEE International Symposium on Information Theory, ISIT 2014
Country/TerritoryUnited States
CityHonolulu, HI
Period29/06/144/07/14

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Codeword or noise? Exact random coding exponents for slotted asynchronism'. Together they form a unique fingerprint.

Cite this