Computer Science – Information Theory
Scientific paper
2008-04-18
Computer Science
Information Theory
8 pages, 7 figures, 1 table; submitted to IEEE Transactions on Information Theory, April 2008
Scientific paper
The paper proposes an improved error-resilient Lempel-Ziv'77 (LZ'77) algorithm employing an adaptive amount of parity bits for error protection. It is a modified version of error resilient algorithm LZRS'77, proposed recently, which uses a constant amount of parity over all of the encoded blocks of data. The constant amount of parity is bounded by the lowest-redundancy part of the encoded string, whereas the adaptive parity more efficiently utilizes the available redundancy of the encoded string, and can be on average much higher. The proposed algorithm thus provides better error protection of encoded data. The performance of both algorithms was measured. The comparison showed a noticeable improvement by use of adaptive parity. The proposed algorithm is capable of correcting up to a few times as many errors as the original algorithm, while the compression performance remains practically unchanged.
Korosec Tomaz
Tomazic Saso
No associations
LandOfFree
An Adaptive-Parity Error-Resilient LZ'77 Compression Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Adaptive-Parity Error-Resilient LZ'77 Compression Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Adaptive-Parity Error-Resilient LZ'77 Compression Algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-303850