On asynchronous capacity and dispersion
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 codew...
Main Author: | |
---|---|
Other Authors: | |
Format: | Article |
Language: | en_US |
Published: |
2013
|
Online Access: | http://hdl.handle.net/1721.1/79664 https://orcid.org/0000-0002-2109-0979 |
_version_ | 1826210728272461824 |
---|---|
author | Polyanskiy, Yury |
author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Polyanskiy, Yury |
author_sort | Polyanskiy, Yury |
collection | MIT |
description | 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. |
first_indexed | 2024-09-23T14:54:36Z |
format | Article |
id | mit-1721.1/79664 |
institution | Massachusetts Institute of Technology |
language | en_US |
last_indexed | 2024-09-23T14:54:36Z |
publishDate | 2013 |
record_format | dspace |
spelling | mit-1721.1/796642022-09-29T11:22:13Z On asynchronous capacity and dispersion Polyanskiy, Yury Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Polyanskiy, Yury 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. 2013-07-22T19:36:14Z 2013-07-22T19:36:14Z 2012-03 Article http://purl.org/eprint/type/ConferencePaper 978-1-4673-3140-1 978-1-4673-3139-5 978-1-4673-3138-8 http://hdl.handle.net/1721.1/79664 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. https://orcid.org/0000-0002-2109-0979 en_US http://dx.doi.org/10.1109/CISS.2012.6310937 Proceedings of the 2012 46th Annual Conference on Information Sciences and Systems (CISS) Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf Polyanskiy via Amy Stout |
spellingShingle | Polyanskiy, Yury On asynchronous capacity and dispersion |
title | On asynchronous capacity and dispersion |
title_full | On asynchronous capacity and dispersion |
title_fullStr | On asynchronous capacity and dispersion |
title_full_unstemmed | On asynchronous capacity and dispersion |
title_short | On asynchronous capacity and dispersion |
title_sort | on asynchronous capacity and dispersion |
url | http://hdl.handle.net/1721.1/79664 https://orcid.org/0000-0002-2109-0979 |
work_keys_str_mv | AT polyanskiyyury onasynchronouscapacityanddispersion |