Evaluations of burst error recovery for VF arithmetic coding

2002 ◽  
Author(s):  
M. Kitakami ◽  
H. Chen ◽  
E. Fujiwara
Keyword(s):  
Error Recovery ◽  
Arithmetic Coding ◽  
Burst Error

Efficient algorithms for burst error recovery using FFT and other transform kernels

1999 ◽  
Vol 47 (4) ◽  
pp. 1065-1075 ◽  
Author(s):  
F. Marvasti ◽  
M. Hasan ◽  
M. Echhart ◽  
S. Talebi
Keyword(s):  
Error Recovery ◽  
Efficient Algorithms ◽  
Burst Error

scholarly journals Burst Error Recovery Method for LZSS Coding

2009 ◽  
Vol E92-D (12) ◽  
pp. 2439-2444 ◽  
Author(s):  
Masato KITAKAMI ◽  
Teruki KAWASAKI
Keyword(s):  
Error Recovery ◽  
Recovery Method ◽  
Burst Error

Table Substitution Box Method for Increasing Security in Interval Splitting Arithmetic Coding

2017 ◽  
Vol 13 (10) ◽  
pp. 6552-6557
Author(s):  
E.Wiselin Kiruba ◽  
Ramar K.
Keyword(s):  
Compression Ratio ◽  
Arithmetic Coding ◽  
Substitution Box ◽  
Plain Text ◽  
T Box ◽  
Novel Approach ◽  
Permutation Methods ◽  
Message Digest ◽  
Box Method ◽  
Arithmetic Coder

Amalgamation of compression and security is indispensable in the field of multimedia applications. A novel approach to enhance security with compression is discussed in this  research paper. In secure arithmetic coder (SAC), security is provided by input and output permutation methods and compression is done by interval splitting arithmetic coding. Permutation in SAC is susceptible to attacks. Encryption issues associated with SAC is dealt in this research method. The aim of this proposed method is to encrypt the data first by Table Substitution Box (T-box) and then to compress by Interval Splitting Arithmetic Coder (ISAC). This method incorporates dynamic T-box in order to provide better security. T-box is a method, constituting elements based on the random output of Pseudo Random Generator (PRNG), which gets the input from Secure Hash Algorithm-256 (SHA-256) message digest. The current scheme is created, based on the key, which is known to the encoder and decoder. Further, T-boxes are created by using the previous message digest as a key.  Existing interval splitting arithmetic coding of SAC is applied for compression of text data. Interval splitting finds a relative position to split the intervals and this in turn brings out compression. The result divulges that permutation replaced by T-box method provides enhanced security than SAC. Data is not revealed when permutation is replaced by T-box method. Security exploration reveals that the data remains secure to cipher text attacks, known plain text attacks and chosen plain text attacks. This approach results in increased security to Interval ISAC. Additionally the compression ratio  is compared by transferring the outcome of T-box  to traditional  arithmetic coding. The comparison proved that there is a minor reduction in compression ratio in ISAC than arithmetic coding. However the security provided by ISAC overcomes the issues of compression ratio in  arithmetic coding. 

Pixel pyramid for lossless image compression using Arithmetic Coding

1993 ◽  
Author(s):  
Krystyna Ohnesorge ◽  
Peter Stucki ◽  
Hartwig Thomas
Keyword(s):  
Image Compression ◽  
Arithmetic Coding ◽  
Lossless Image Compression
Sign in / Sign up

Export Citation Format

Share Document