Joint Source/Channel Coding Using Arithmetic Codes
DCC '00 Proceedings of the Conference on Data Compression
Progressive and error-resilient transmission strategies for VLC encoded signals over noisy channels
EURASIP Journal on Applied Signal Processing
Error recovery properties and soft decoding of quasi-arithmetic codes
EURASIP Journal on Advances in Signal Processing
Shortest Synchronizing Strings for Huffman Codes
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Shortest synchronizing strings for Huffman codes
Theoretical Computer Science
Joint compression and data protection
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Design and analysis of synchronizable error-resilient arithmetic codes
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Error recovery of variable length code over BSC with arbitrary crossover probability
IEEE Transactions on Communications
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 754.84 |
When an error occurs in the encoded bit stream produced by a variable length code, the decoder may lose synchronization. A state model for synchronization recovery is developed, and a method for determining the expected span of source symbols lost is presented. The performance of various codes with respect to error recovery is discussed. Two examples are given where equivalent optimal codes have a marked difference in their error recovery characteristics. Some open problems are indicated.