|
|
|
|
| LEADER |
01401 am a22001693u 4500 |
| 001 |
79664 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Polyanskiy, Yury
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
| 100 |
1 |
0 |
|a Polyanskiy, Yury
|e contributor
|
| 245 |
0 |
0 |
|a On asynchronous capacity and dispersion
|
| 260 |
|
|
|c 2013-07-22T19:36:14Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/79664
|
| 520 |
|
|
|a 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.
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Proceedings of the 2012 46th Annual Conference on Information Sciences and Systems (CISS)
|
