TY - GEN
T1 - Combined permutation codes for synchronization
AU - Heymann, R.
AU - Ferreira, H. C.
AU - Swart, T. G.
PY - 2012
Y1 - 2012
N2 - A combined code is a code that combines two or more characteristics of other codes. A construction is presented in this paper of permutation codes that are self-synchronizing and able to correct a number of deletion errors per codeword, thus a combined permutation code. Synchronization errors, modelled as deletion(s) and/or insertion(s) of bits or symbols, can be catastrophic if not detected and corrected. Some classes of codes have been proposed that are synchronizable, i.e. they can be used to regain synchronization although the error leading to the loss of synchronization is not corrected. Typically, different classes of codes are needed to correct deletion and/or insertion errors after codeword boundaries have been detected. The codebooks presented in this paper consist of codewords divided into segments. By imposing restrictions on the segments, the codewords are synchronizable. One deletion error can be detected and corrected per segment.
AB - A combined code is a code that combines two or more characteristics of other codes. A construction is presented in this paper of permutation codes that are self-synchronizing and able to correct a number of deletion errors per codeword, thus a combined permutation code. Synchronization errors, modelled as deletion(s) and/or insertion(s) of bits or symbols, can be catastrophic if not detected and corrected. Some classes of codes have been proposed that are synchronizable, i.e. they can be used to regain synchronization although the error leading to the loss of synchronization is not corrected. Typically, different classes of codes are needed to correct deletion and/or insertion errors after codeword boundaries have been detected. The codebooks presented in this paper consist of codewords divided into segments. By imposing restrictions on the segments, the codewords are synchronizable. One deletion error can be detected and corrected per segment.
UR - http://www.scopus.com/inward/record.url?scp=84873561706&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84873561706
SN - 9784885522673
T3 - 2012 International Symposium on Information Theory and Its Applications, ISITA 2012
SP - 230
EP - 234
BT - 2012 International Symposium on Information Theory and Its Applications, ISITA 2012
T2 - 2012 International Symposium on Information Theory and Its Applications, ISITA 2012
Y2 - 28 October 2012 through 31 October 2012
ER -