Error exponents for sparse communication

Lóránt Farkas, Tamás Kói, I. Csiszár

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

2 Citations (Scopus)

Abstract

Communication over a discrete memoryless channel is addressed when codewords are transmitted in certain time intervals of arbitrary locations, at other times the channel outputs pure noise. The receiver has to locate and decode the codewords. Exponential error bounds are derived, jointly achievable via a semi-universal or universal decoder. Implications are discussed for the familiar model of communication under strong asynchronism when in exponentially long time only one codeword is transmitted.

Original languageEnglish
Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3145-3149
Number of pages5
ISBN (Electronic)9781509040964
DOIs
Publication statusPublished - Aug 9 2017
Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
Duration: Jun 25 2017Jun 30 2017

Other

Other2017 IEEE International Symposium on Information Theory, ISIT 2017
CountryGermany
CityAachen
Period6/25/176/30/17

Keywords

  • Error exponent
  • False alarm
  • Inclusive error
  • Strong asynchronism
  • Universality

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Error exponents for sparse communication'. Together they form a unique fingerprint.

  • Cite this

    Farkas, L., Kói, T., & Csiszár, I. (2017). Error exponents for sparse communication. In 2017 IEEE International Symposium on Information Theory, ISIT 2017 (pp. 3145-3149). [8007109] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2017.8007109