A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Joint source-channel decoding of quasi-arithmetic codes
Data Compression Conference, 2004. Proceedings. DCC 2004
This paper addresses the issue of robust and joint source-channel decoding of quasi-arithmetic codes. Quasi-arithmetic coding is a reduced precision and complexity implementation of arithmetic coding. This paper provides rst a state model of a quasi-arithmetic decoder for binary and M-ary sources. The design of an error-resilient s o f t decoding algorithm follows quite naturally. The compression e ciency of quasi-arithmetic codes allows to add extra redundancy in the form of markers designeddoi:10.1109/dcc.2004.1281472 dblp:conf/dcc/GuionnetG04 fatcat:e4kcxjinzrdrbjwrdtfsfbab4i