Based on the encoding process, arithmetic codes can be viewed as tree codes and current
proposals for decoding arithmetic codes with forbidden symbols belong to sequential …

Previous work has indicated that using an arithmetic encoder with reserved probability
space can provide powerful error detection and error correction when used with a sequential …

Current proposals for using arithmetic coding in a joint source/channel coding framework
require'soft'information to provide error correction. However, in many applications only the …

We focus on a trellis-based decoding technique for variable length codes (VLCs) which
does not require any additional side information besides the number of bits in the coded …

Table look-up based decoding schemes for convolutionally encoded data have been
designed for both block coding [5], and convolutional coding [6, 21. However, in the latter …

Reserving space fur a symbol that is not in the source alphabet has been shown to provide
excellent error detection. In this paper, we show how to exploit this capability using two …

In joint source-channel arithmetic coding (JSCAC) schemes, additional redundancy may be
introduced into an arithmetic source code in order to be more robust against transmission …

Analog decoding of high rate tailbiting codes using the dual trellis Page 1 ISIT2001,
Washington, DC, June 24-29, 2001 Analog Decoding of High Rate Tailbiting Codes Using the …

The issue of robust and joint source-channel decoding of quasi-arithmetic codes is
addressed. Quasi-arithmetic coding is a reduced precision and complexity implementation …

In joint source-channel (JSC) schemes based on arithmetic coding (AC), additional
redundancy may be introduced in order to reduce transmission errors. The purpose of this …