English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The paper proposes an improved error-resilient Lempel-Ziv'77 (LZ'77)algorithm employing an adaptive amount of parity bits for error protection. Itis 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 theencoded string, whereas the adaptive parity more efficiently utilizes theavailable 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 anoticeable improvement by use of adaptive parity. The proposed algorithm iscapable of correcting up to a few times as many errors as the originalalgorithm, while the compression performance remains practically unchanged.

An Adaptive-Parity Error-Resilient LZ'77 Compression Algorithm