Repair and Restoration of Corrupted LZSS Files

Data compression and decompression have been widely used in modern communication and data transmission. But how to decompress the corrupted lossless compressed files remains a challenge. Aiming at the Lempel–Ziv–Storer–Szymanski (LZSS), a lossless data compression algorithm widely used in the field of general coding, this paper proposes an effective method to repair the errors and decompress and restore the corrupted LZSS files, and provides the theoretical basis for the method. By using the residual redundancy left by the LZSS encoder to carry the check information, the method can repair the errors in LZSS compressed data without any loss of compression performance. The proposed method neither requires additional bits nor changes coding rules or data formats. It is fully compatible with standard algorithms. That is, the data compressed by LZSS with error repair capability can still be decompressed by the standard LZSS decoder. The experimental results verify the validity and practicability of the proposed method.

[1]  Sanghoon Lee,et al.  Novel Error Detection Algorithm for LZSS Compressed Data , 2017, IEEE Access.

[2]  Sergio Verdú,et al.  Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics , 2014, IEEE Transactions on Information Theory.

[3]  Shidhartha Das,et al.  Error-Resilient Design Techniques for Reliable and Dependable Computing , 2014, IEEE Transactions on Device and Materials Reliability.

[4]  Mikhail J. Atallah,et al.  Augmenting LZ‐77 with authentication and integrity assurance capabilities , 2004, Concurr. Pract. Exp..

[5]  Ron Dabora,et al.  On Joint Source-Channel Coding for Correlated Sources Over Multiple-Access Relay Channels , 2014, IEEE Transactions on Information Theory.

[6]  F. Moore,et al.  Polynomial Codes Over Certain Finite Fields , 2017 .

[7]  Gopal Lakhani,et al.  Reducing coding redundancy in LZW , 2006, Inf. Sci..

[8]  Feng Jiang,et al.  Compressed Vision Information Restoration Based on Cloud Prior and Local Prior , 2014, IEEE Access.

[9]  Qingquan Sun,et al.  Novel Fault-Tolerant Decompression Method of Corrupted Huffman Files , 2018, Wirel. Pers. Commun..

[10]  John D. Ferguson,et al.  Interception of Multiple Low-Power Linear Frequency Modulated Continuous Wave Signals , 2017, IEEE Transactions on Aerospace and Electronic Systems.

[11]  Sergio Verdú,et al.  Variable-Length Compression Allowing Errors , 2014, IEEE Transactions on Information Theory.

[12]  Richard Demo Souza,et al.  Unequal error protection for LZSS compressed data using Reed-Solomon codes , 2007, IET Commun..

[13]  Shih-Lun Chen,et al.  VLSI Implementation of a Cost-Efficient Near-Lossless CFA Image Compressor for Wireless Capsule Endoscopy , 2016, IEEE Access.

[14]  Masato Kitakami,et al.  Burst Error Recovery Method for LZSS Coding , 2009, IEICE Trans. Inf. Syst..

[15]  Philippe Jacquet,et al.  Average Size of a Suffix Tree for Markov Sources , 2016, ArXiv.

[16]  Kunihiko Sadakane,et al.  Fast Relative Lempel-Ziv Self-index for Similar Sequences , 2012, FAW-AAIM.

[17]  Michael Drmota,et al.  Redundancy of Lossless Data Compression for Known Sources by Analytic Methods , 2017, Found. Trends Commun. Inf. Theory.

[18]  Wojciech Szpankowski,et al.  Analysis of Randomized Selection Algorithm Motivated by the LZ'77 Scheme , 2004, ALENEX/ANALC.

[19]  Guy Louchard,et al.  On the average redundancy rate of the Lempel-Ziv code , 1997, IEEE Trans. Inf. Theory.

[20]  Shmuel Tomi Klein,et al.  Practical fixed length Lempel-Ziv coding , 2010, Discret. Appl. Math..

[21]  Jie Zhang,et al.  A Universal Grammar-Based Code for Lossless Compression of Binary Trees , 2014, IEEE Transactions on Information Theory.

[22]  Sangjin Lee,et al.  Recovery of Damaged Compressed Files for Digital Forensic Purposes , 2008, 2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008).

[23]  Gordhan Das Menghwar,et al.  Cooperative versus non-cooperative communications , 2009, 2009 2nd International Conference on Computer, Control and Communication.

[24]  Dominik Kempa,et al.  LZ-End Parsing in Compressed Space , 2016, 2017 Data Compression Conference (DCC).