Sian-Jheng Lin

A Modified Version of Huffman Coding with Random Access Abilities

2018

In this paper, a modified version of canonical Huffman coding is presented, such that a certain level of random access on the compressed file is allowed. Compared with the prior methods, the proposed approach does …

SortComp (Sort-and-Compress) - Towards a Universal Lossless Compression Scheme for Matrix and Tabular Data

2022

A universal scheme is proposed for the lossless compression of two-dimensional tables and matrices. Instead of standard row- or column-based compression, we propose to sort each column first and record both the sorted table and …

Reduced-Complexity Erasure Decoding of Low-Rate Reed–Solomon Codes Based on LCH-FFT

2023

This paper presents a new erasure decoding algorithm for low-rate Reed–Solomon codes (rate ≤ 0.5) based on a recently proposed FFT known as LCH-FFT. The algorithm requires O(n log k) finite field operations, where n …