Efficient chain code compression with interpolative coding

DOI10.1016/j.ins.2018.01.045zbMath1446.94050OpenAlexW2791704282MaRDI QIDQ2195467

Borut Žalik, Domen Mongus, Krista Rizman Žalik, Niko Lukač

Publication date: 8 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.01.045

zbMATH Keywords

lossless compressionchain codes\( \psi \)-codingFELICS coding

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Related Items (1)

Can Burrows-Wheeler transform be replaced in chain code compression?

Cites Work

• An efficient raster font compression for embedded systems
• Lossless compression of map contours by context tree modeling of chain codes
• Efficiency of chain codes to represent binary objects
• A new relative chain code in 3D
• Data compression by means of a ``book stack
• Compressed vertex chain codes
• An analysis of the Burrows—Wheeler transform
• Linear work suffix array construction
• Handbook of Data Compression
• A locally adaptive data compression scheme
• Scalable Parallel Suffix Array Construction
• Two Efficient Algorithms for Linear Time Suffix Array Construction

This page was built for publication: Efficient chain code compression with interpolative coding