Codebook and Marker Sequence Design for Synchronization-Correcting Codes
Buttigieg, V and Briffa, JA (2011) Codebook and Marker Sequence Design for Synchronization-Correcting Codes In: IEEE International Symposium on Information Theory Proceedings (ISIT), 2011, 2011-07-31 - 2011-08-05, St Petersburg.
isit2011-proceedings.pdf - Accepted Version
We propose a construction based on synchronization and error-correcting block codes and a matched marker sequence. The block codes can correct insertion, deletion and substitution errors within each codeword. The marker sequence allows the decoder to maintain synchronization at codeword boundaries even at high error rates. An upper bound is given for the performance of these codes over a channel with random substitutions and synchronization errors. It is shown that the performance is largely dependent on the code's minimum Levenshtein distance. The performance of these codes is verified by simulation and compared to published results. In concatenation with a non-binary outer code we obtain a significant improvement in frame error rate at similar overall code rates.
|Item Type:||Conference or Workshop Item (Paper)|
|Divisions :||Faculty of Engineering and Physical Sciences > Computing Science|
|Identification Number :||10.1109/ISIT.2011.6033810|
|Additional Information :||
Copyright 2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
|Depositing User :||Symplectic Elements|
|Date Deposited :||08 Dec 2011 12:35|
|Last Modified :||23 Sep 2013 18:50|
Actions (login required)
Downloads per month over past year