Undetected errors in quasi-cyclic LDPC codes caused by receiver symbol slips
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Correcting deletions using linear and cyclic codes
IEEE Transactions on Information Theory
Spectrum of Sizes for Perfect Deletion-Correcting Codes
SIAM Journal on Discrete Mathematics
| Hi-index | 754.90 |
We analyze the performance of a Reed-Muller RM(1,m) code over a channel that, in addition to substitution errors, permits either the repetition of a single bit or the deletion of a single bit; the latter feature is used to model synchronization errors. We first analyze the run-length structure of this code. We enumerate all pairs of codewords that can result in the same sequence after the deletion of a single bit, and propose a simple way to prune the code by dropping one information bit such that the resulting linear subcode has good post-deletion and post-repetition minimum distance. A bounded distance decoding algorithm is provided for the use of this pruned code over the channel. This algorithm has the same order of complexity as the usual fast Hadamard transform based decoder for the RM(1,m) code