An efficient joint dynamic detection technique for wireless transmission of JPEG2000 encoded images
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Soft and joint source-channel decoding of quasi-arithmetic codes
EURASIP Journal on Applied Signal Processing
IEEE Transactions on Communications
Adaptive chosen-ciphertext attack on secure arithmetic coding
IEEE Transactions on Signal Processing
International Journal of Modelling and Simulation
Design and analysis of synchronizable error-resilient arithmetic codes
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Chase-Like Decoding of Arithmetic Codes with Applications
International Journal of Computer Vision and Image Processing
| Hi-index | 0.08 |
Block cyclic redundancy check (CRC) codes are typically used to perform error detection in automatic repeat request (ARQ) protocols for data communications. Although efficient, CRCs can detect errors only after an entire block of data has been received and processed. We propose a new “continuous” error detection scheme using arithmetic coding that provides a novel tradeoff between the amount of added redundancy and the amount of time needed to detect an error once it occurs. This method of error detection, first introduced by Bell, Witten, and Cleary (1990), is achieved through the use of an arithmetic codec, and has the attractive feature that it can be combined physically with arithmetic source coding, which is widely used in state of-the-art image coders. We analytically optimize the tradeoff between added redundancy and error-detection time, achieving significant gains in bit rate throughput over conventional ARQ schemes for binary symmetric channel models for all probabilities of error