IEEE Transactions on Information Theory
Interactive communication of balanced distributions and of correlated files
SIAM Journal on Discrete Mathematics
Novel bounds on the capacity of binary channels with deletions and substitutions
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
| Hi-index | 0.00 |
For communications and networking channels, coding techniques are widely used to correct errors in corrupted messages. The "Quality of Protection" (QoP) that can be provided via error correction directly affects the "Quality of Service" (QoS) experienced by users. The errors are commonly assumed to be substitution or erasure errors. Such systems rely on perfect synchronization so that no bit is deleted and no extra bit is inserted. However, in a system without the presence of perfect synchronization, special coding algorithms may be required to correct potential insertion or deletion errors in transmitted messages. Especially for systems suffering from frequent loss of synchronization, packets may require many retransmissions to guarantee reliable communication. Such schemes may become too expensive to be practical. In this paper, we propose a new synchronization channel error model based on the observations from current communication systems. In this model, the channel introduces at most t synchronization errors in each run of the transmitted sequence. We present run-length limited permutation codes capable of correcting synchronization errors based on this channel error model. Compared to previously developed codes, our codes have the advantage of correcting frequent synchronization errors, and therefore they are suitable for disruptive network channels that suffer severe synchronization failures.