Year: 2013
Type: article
Abstract: Arithmetic compression scheme is one of the commonly used techniques to represent more amount of information using the available units of resources.It has been known that arithmetic coding has a better coding efficiency than other compression schemes.However, when used in an error prone environment, the poor error resistance property of the method is a severe disadvantage.It is difficult to locate an error when arithmetic coding is used and a large portion of a data must be discarded when an error occurs.In this paper, a novel technique is proposed to improve the error resilience of arithmetic coding, in which the decoder is less affected by the errors caused in the transmission of data over the network.A comparative study with the basic algorithm demonstrates that the time performance of the error resilient arithmetic coder is somewhat comparable to the basic algorithm.
DOI: 10.5120/12750-9688
Authors: Lakshmi Sasilal, V. K. Govindan
Institution: National Institute of Technology Calicut
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2109730107