Evaluations of burst error recovery for VF arithmetic coding
Masato Kitakami, H. Chen, Eiji Fujiwara · 2002
Since compressed data are very sensitive to errors, several error control methods for compressed data have been proposed. The authors also proposed Burst Error Recovery VF Arithmetic Coding, or BREVFAC. This paper gives additional evaluations of BERVFAC which are not shown in the previous paper, i.e., time to execute encoding/decoding programs and error recovery probabilities under several conditions, by computer simulations. As another type of evaluation, this also evaluates influence of errors by counting the number of erroneous lines in decompressed data. Simulation results show that BERVFAC protects compressed data from burst errors which are beyond error recovery capability of the coding. For example, burst errors with more than 16 bits and less than 29 bits length corrupt about 0.3% of decompressed data in BERVFAC with source file "paper1", 1024 bits codeword, and 16 bits burst error recovery capability.