Reconstructing strings from random traces
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Trace reconstruction with constant deletion probability and related results
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Asymptotically good codes correcting insertions, deletions, and transpositions
IEEE Transactions on Information Theory
Efficient reconstruction of sequences
IEEE Transactions on Information Theory
Efficient erasure correcting codes
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Reliable communication over channels with insertions, deletions, and substitutions
IEEE Transactions on Information Theory
On information transmission over a finite buffer channel
IEEE Transactions on Information Theory
On Lower Bounds for the Capacity of Deletion Channels
IEEE Transactions on Information Theory
A Simple Lower Bound for the Capacity of the Deletion Channel
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels
IEEE Transactions on Information Theory
Capacity Bounds for Sticky Channels
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The binary symmetric channel, where each bit is independently received in error with probability p, and the binary erasure channel, where each bit is erased with probability p, enjoy a long and rich history. Shannon developed the fundamental results on the capacity of such channels in the 1940's [19], and in recent years, through the development and analysis of low-density parity-check codes and related families of codes, we understand how to achieve near-capacity performance for such channels extremely efficiently [2,13,17].