Resynchronization Properties of Arithmetic Coding
Lists
Only you see this
Abstract
This paper considers decoding an arithmetic code stream when an initial portion of the code stream is unknown. Full resynchronization is hypothesized to have complexity that is exponential in the length of the initial portion. Experimental results specify the time complexity of determining the current arithmetic code interval, which is the important task in partial resynchronization.
BibTeX
@inproceedings{moo1999resynchronization,
author = {Peter W. Moo and Xiaolin Wu},
title = {{Resynchronization Properties of Arithmetic Coding}},
booktitle = {ICIP},
year = {1999},
doi = {10.1109/icip.1999.822955},
}Loading related content...