On asynchronous capacity and dispersion
Name
async_ciss.pdf
Size
147.83 KB
Format
Adobe PDF
Checksum (MD5)
50843d69db3a32b74314a56f3ba9384b
Author(s)
Polyanskiy, Yury
Date Issued
March 2012
Journal
Proceedings of the 2012 46th Annual Conference on Information Sciences and Systems (CISS)
Citation
Polyanskiy, Yury. On Asynchronous Capacity and Dispersion. In 2012 46th Annual Conference on Information Sciences and Systems (CISS), 1-6. Institute of Electrical and Electronics Engineers, 2012.
Version
Author's final manuscript
Abstract
Recently Tchamkerten et al. proposed a mathematical formulation of the problem of joint synchronization and error-correction in noisy channels. A variation of their formulation in this paper considers a strengthened requirement that the decoder estimate both the message and the location of the codeword exactly. It is shown that the capacity region remains unchanged and that the strong converse holds. The finite blocklength regime is investigated and it is demonstrated that even for moderate blocklengths, it is possible to construct capacity-achieving codes that tolerate exponential level of asynchronism and experience only a rather small loss in rate compared to the perfectly synchronized setting; in particular, the channel dispersion does not suffer any degradation due to asynchronism.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/CISS.2012.6310937
