Data compression has been commonly employed to reduce the required memory size for
emerging applications with large storage needs like Big Data and Machine Learning (ML) …

Arithmetic coding achieves a superior coding rate when encoding a binary source, but its
lack of speed makes it an inferior choice when true high-performance encoding is needed …

With its bulky volume, the ultraspectral sounder data might still suffer a few bits of error after
channel coding. Therefore it is beneficial to incorporate some mechanism in source coding …

In an error-prone environment the compression of ultraspectral sounder data is vulnerable to
error propagation. The Tungstall coding is a variable-to-fixed length code which compresses …

資料壓縮方法分為有損與無損兩種, 而大部分無損壓縮法遇雜訊皆有嚴重錯誤擴散情形,
例如Huffman 編碼, 算術編碼, Ziv-Lempel 編碼等. 只有Tunstall 編碼因採用固定長度字碼 …

The error performance of the Tunstall code is analysed, and a relevant metric defined.
Several parameters in the encoding process are considered, with the objective of minimising …

By using fixed-length codewords and not using an adaptive dictionary, the Tunstall coding
stands out as an errorresilient lossless compression technique. Our previous work has …

Arithmetic coding achieves a superior coding rate when encoding a binary source, but its
lack of speed makes it an inferior choice when true high-performance encoding is needed …

We present our work on fast entropy coders for binary messages utilizing only bit shifts and
table lookups. To minimize code table size we limit our code lengths with a novel type of …

Scientific computation is used for the simulation of increasingly complex phenomena, and
generates data sets of ever increasing size, often on the order of terabytes. All of this data …