Abstract
Prefix codes such as Huffman codes are commonly used for loseless data compression. The class of synchronizing codes is often chosen to improve error resilience or to enable parallel decoding of data. Such codes have a special sequence whose occurrence realigns decoding process leading to recovery from errors in a data stream. In the present paper we identify a class of codes whose synchronizability depends only on the lengths of codewords. Namely, we show that every maximal finite prefix code with only two codeword lengths is synchronizing if and only if these lengths are coprime.
Author supplied keywords
Cite
CITATION STYLE
Gusev, V. V., & Pribavkina, E. V. (2019). On Codeword Lengths Guaranteeing Synchronization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11682 LNCS, pp. 207–216). Springer Verlag. https://doi.org/10.1007/978-3-030-28796-2_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
