Backward Weighted Coding

Extending recently suggested methods, a new dynamic compression algorithm is proposed, which assigns larger weights to characters that have just been coded by means of an increasing weight function. Empirical results present its efficient compression performance, which, for input files with locally...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:DCC (Los Alamitos, Calif.) s. 93 - 102
Hlavní autoři: Fruchtman, Aharon, Gross, Yoav, Klein, Shmuel T., Shapira, Dana
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.03.2021
Témata:
Arithmetic Coding
Compression algorithms
Data compression
Encoding
Entropy
Heuristic algorithms
Huffman Coding
Static and Dynamic Coding
ISSN:2375-0359
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Extending recently suggested methods, a new dynamic compression algorithm is proposed, which assigns larger weights to characters that have just been coded by means of an increasing weight function. Empirical results present its efficient compression performance, which, for input files with locally skewed distributions, can improve beyond the lower bound given by the entropy for static encoding, at the price of slower running times for compression, and comparable time for decompression.
ISSN:2375-0359
DOI:10.1109/DCC50243.2021.00017