Yunghsiang S. Han

On the Maximum Size of Block Codes Subject to a Distance Criterion

2018 · IEEE Transactions on Information Theory

We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than d. The achievability argument involves an iterative construction of a set of radius-d balls, …

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 …