Systematic Deletion/Insertion Error Correcting Codes with Random Error Correction Capability
DFT '99 Proceedings of the 14th International Symposium on Defect and Fault-Tolerance in VLSI Systems
Improving performance on the internet
Communications of the ACM - Inspiring Women in Computing
Loss and Delay Measurements of Internet Backbones
Computer Communications
IEEE Transactions on Information Theory
Systematic encoding of the Varshamov-Tenengol'ts codes and the Constantin-Rao codes
IEEE Transactions on Information Theory
Reliable communication over channels with insertions, deletions, and substitutions
IEEE Transactions on Information Theory
Using Reed–Muller RM (1, m) Codes Over Channels With Synchronization and Substitution Errors
IEEE Transactions on Information Theory
| Hi-index | 754.84 |
Linear and cyclic codes are typically used to combat substitution errors. However, synchronization errors, associated with the deletion and insertion of symbols, can cause severe performance degradation unless the coding scheme possesses the capability to recover from such errors. It is shown that linear codes of rate greater than 1/2 cannot correct deletion or insertion errors but there are linear codes of rate 1/2 that can correct these errors. Although cyclic codes, except for repetition codes, cannot correct deletion or insertion errors, two approaches are investigated to yield codes, based on cyclic codes, that can correct these errors. In the first approach, it is shown that a binary or nonbinary cyclic code of rate at most 1/3 or 1/2, respectively, can be extended by one symbol to make it capable of correcting synchronization errors. In the second approach, a cyclic code of rate at most 1/2 is expurgated by appropriately deleting codewords such that the expurgated code is capable of correcting synchronization errors. It is shown that deleting codewords costs at most two information bits if the code is binary and one information symbol if the code is non-binary.