Two Contributions to Error Exponents for Asynchronous Multiple Access Channel

The following conjectures from previous work of the authors are proven, enhancing the relevance of results there on the subject in the title: (i) The error exponents previously derived assuming that consecutive messages could be encoded using different codebooks, are also achievable with each sender...

Full description

Saved in:
Bibliographic Details
Published inProceedings / IEEE International Symposium on Information Theory pp. 2664 - 2668
Main Authors Farkas, Lorant, Koi, Tamas
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2019
Subjects
Channel coding
Decoding
Delays
error exponent
frame asynchronous channel
Indexes
multiple-access channel
Random variables
subtypes
Synchronization
universal coding
Online AccessGet full text
ISSN2157-8117
DOI10.1109/ISIT.2019.8849722

Cover

More Information
Summary:The following conjectures from previous work of the authors are proven, enhancing the relevance of results there on the subject in the title: (i) The error exponents previously derived assuming that consecutive messages could be encoded using different codebooks, are also achievable with each sender using only one codebook. (ii) In case the senders could be synchronized, controlled asynchronism (a deliberate shift of codewords) may admit to achieve error exponents unachievable by synchronous transmission.
ISSN:2157-8117
DOI:10.1109/ISIT.2019.8849722