Codeword or noise? Exact random coding exponents for slotted asynchronism
Information Theory
2013-08-22 v1 math.IT
Abstract
We consider the problem of slotted asynchronous coded communication, where in each time frame (slot), the transmitter is either silent or transmits a codeword from a given (randomly selected) codebook. The task of the decoder is to decide whether transmission has taken place, and if so, to decode the message. We derive the optimum detection/decoding rule in the sense of the best trade-off among the probabilities of decoding error, false alarm, and misdetection. For this detection/decoding rule, we then derive single-letter characterizations of the exact exponential rates of these three probabilities for the average code in the ensemble.
Cite
@article{arxiv.1308.4572,
title = {Codeword or noise? Exact random coding exponents for slotted asynchronism},
author = {Neri Merhav},
journal= {arXiv preprint arXiv:1308.4572},
year = {2013}
}
Comments
23 pages; Submitted to IEEE Trans. Inform. Theory