2019
DOI: 10.1109/access.2019.2891764
|View full text |Cite
|
Sign up to set email alerts
|

Repair and Restoration of Corrupted LZSS Files

Abstract: 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 redundanc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 24 publications
0
2
0
Order By: Relevance
“…Benefiting from the redundancy, the encoded results can always be decoded correctly as long as the errors (such as data loss or forgery) do not exceed the upper limits of the capabilities for error detection and correction, which improve with more redundancy [27]. Thus, error-correcting coding is widely used in data backup and distributed storage [28,29].…”
Section: Reed-solomon Codementioning
confidence: 99%
“…Benefiting from the redundancy, the encoded results can always be decoded correctly as long as the errors (such as data loss or forgery) do not exceed the upper limits of the capabilities for error detection and correction, which improve with more redundancy [27]. Thus, error-correcting coding is widely used in data backup and distributed storage [28,29].…”
Section: Reed-solomon Codementioning
confidence: 99%
“…Many applications and algorithms create the dictionary dynamically, hence, when there is an input, the dictionary can be updated as needed. There are more than 19 algorithms support dictionary-based algorithms such as Byte pair encoding [ 105 ], Lz77 [ 87 , 106 , 107 ], Lz78 [ 74 ], (LZW) Lempel–Ziv–Welch [ 108 ], (LZSS) Lempel–Ziv–Storer–Szymanski [ 103 , 109 , 110 , 111 ], (LZS) Lempel–Ziv–Stac [ 112 ], (LZO) Lempel–Ziv–Oberhumer [ 113 , 114 ], Snappy [ 115 , 116 ], Brotli [ 117 , 118 ], Deflate [ 119 ], Deflate64 [ 120 ], LZ4 [ 121 , 122 , 123 ], (LZFSE) Lempel–Ziv Finite State Entropy [ 124 , 125 ], (LZJB) Lempel Ziv Jeff Bonwick [ 108 ], (LZMA) Lempel-Ziv-Markov chain-Algorithm [ 108 ], (LZRW) Lempel–Ziv Ross Williams [ 108 , 121 , 126 ], LZWL [ 127 , 128 ], LZX [ 129 ].…”
Section: Compressionmentioning
confidence: 99%
“…LZ77 [9] and LZ78 [16] are the most famous algorithms. LZSS is the most popular versions of LZ77 [17][18][19]. There are many researches works on LZ design for data compression.…”
Section: Related Workmentioning
confidence: 99%