Yunghsiang S. Han
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yunghsiang S. Han has a total of 106 co-authors. Here are the top co-authors by number of shared publications:
- Sian-Jheng Lin
School of Cyber Science and Technology, University of Science and Technology of China, Hefei, China
16 shared publications - Hanxu Hou
Dongguan University of Technology, Dongguan, China
12 shared publications - Po-Ning Chen
Institute of Communications Engineering National Yang-Ming Chiao-Tung University Taiwan R.O.C
12 shared publications - Bo Bai
Huawei Technologies Company Ltd., Shenzhen, China
9 shared publications - Pramod K. Varshney
Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY, USA
8 shared publications - Gong Zhang
Huawei Technologies CO., Ltd, Shenzhen, China
7 shared publications
Latest Publications
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (7) , 4719-4738
Generalized Inverse Discrete Fourier Transform With Application to Goppa Codes
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (7) , 4719-4738
Generalized Inverse Discrete Fourier Transform With Application to Goppa Codes
- 5 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
The Construction of Near-Optimal Universal Coding of Integers
The Universal Coding of Integers (UCI) is suitable for discrete memoryless sources with unknown probability distributions and infinitely countable alphabet sizes. A UCI is a class of prefix codes for which the ratio of the average codeword length to max{1,H(P)} is within a constant expansion factor CC for any decreasing probability distribution P, where H(P) is the entropy of P. For any UCI code C, the minimum expansion factor C∗ C is defined to represent the infimum of the set of extension factors of C. Each C has a unique corresponding C∗ C, and the smaller C∗ C is, the better the compression performance of C is. The class of UCIs C (or a family {Ci}∞ i=1) that achieves the smallest C∗ C is defined as the optimal UCI. The best current result is that the range of C∗ C for the optimal UCI is 2 ≤ C∗ C ≤ 2.5. In this paper, we prove a tighter probability inequality for decreasing distributions, which serves as a new tool for studying the properties of UCIs. On the basis of this inequality, we prove that there exists a class of near-optimal UCIs, called the ν code, achieving Cν = 2.0386. This narrows the range of the minimum expansion factor for the optimal UCI to 2 ≤ C∗ C ≤ 2.0386. We show that the ν code is currently optimal in terms of the minimum expansion factor. In addition, we propose a new proof showing that the minimum expansion factor of the optimal UCI is lower bounded by 2.
- 5 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
The Construction of Near-Optimal Universal Coding of Integers
The Universal Coding of Integers (UCI) is suitable for discrete memoryless sources with unknown probability distributions and infinitely countable alphabet sizes. A UCI is a class of prefix codes for which the ratio of the average codeword length to max{1,H(P)} is within a constant expansion factor CC for any decreasing probability distribution P, where H(P) is the entropy of P. For any UCI code C, the minimum expansion factor C∗ C is defined to represent the infimum of the set of extension factors of C. Each C has a unique corresponding C∗ C, and the smaller C∗ C is, the better the compression performance of C is. The class of UCIs C (or a family {Ci}∞ i=1) that achieves the smallest C∗ C is defined as the optimal UCI. The best current result is that the range of C∗ C for the optimal UCI is 2 ≤ C∗ C ≤ 2.5. In this paper, we prove a tighter probability inequality for decreasing distributions, which serves as a new tool for studying the properties of UCIs. On the basis of this inequality, we prove that there exists a class of near-optimal UCIs, called the ν code, achieving Cν = 2.0386. This narrows the range of the minimum expansion factor for the optimal UCI to 2 ≤ C∗ C ≤ 2.0386. We show that the ν code is currently optimal in terms of the minimum expansion factor. In addition, we propose a new proof showing that the minimum expansion factor of the optimal UCI is lower bounded by 2.
- 20 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (6) , 3784-3798
Two Fast Erasure Decoding Algorithms for Reed–Solomon Codes Based on LCH-FFT
Based on a recently proposed fast Fourier transform by Lin, Chung, and Han, this paper presents two fast erasure decoding algorithms for Reed–Solomon (RS) codes over binary extension fields of length $N$ and dimension $K$ . The first algorithm applies to low-rate RS codes (i.e., $\frac {K}{N} \leq 0.5$ ) and achieves a complexity of $O(N \log K)$ . The second algorithm applies to high-rate RS codes (i.e., $\frac {K}{N} \geq 0.5$ ) and achieves a complexity of $O(N \log (N-K))$ . Compared to recent state-of-the-art algorithms, both proposed algorithms achieve the best complexity, resulting in significant throughput improvements in Single Instruction Multiple Data (SIMD) based simulations. Besides yielding new fast algorithms for RS codes, this paper also presents a new interpolation formula, as well as related results, which may be of independent interest.
- 20 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (6) , 3784-3798
Two Fast Erasure Decoding Algorithms for Reed–Solomon Codes Based on LCH-FFT
Based on a recently proposed fast Fourier transform by Lin, Chung, and Han, this paper presents two fast erasure decoding algorithms for Reed–Solomon (RS) codes over binary extension fields of length $N$ and dimension $K$ . The first algorithm applies to low-rate RS codes (i.e., $\frac {K}{N} \leq 0.5$ ) and achieves a complexity of $O(N \log K)$ . The second algorithm applies to high-rate RS codes (i.e., $\frac {K}{N} \geq 0.5$ ) and achieves a complexity of $O(N \log (N-K))$ . Compared to recent state-of-the-art algorithms, both proposed algorithms achieve the best complexity, resulting in significant throughput improvements in Single Instruction Multiple Data (SIMD) based simulations. Besides yielding new fast algorithms for RS codes, this paper also presents a new interpolation formula, as well as related results, which may be of independent interest.
- Open Access
The Construction of Near-optimal Universal Coding of Integers
Universal Coding of Integers (UCI) is suitable for discrete memoryless sources with unknown probability distributions and infinitely countable alphabet sizes. The UCI is a class of prefix codes, such that the ratio of the average codeword length to $\max\{1, H(P)\}$ is within a constant expansion factor $K_{\mathcal{C}}$ for any decreasing probability distribution $P$, where $H(P)$ is the entropy of $P$. For any UCI code $\mathcal{C}$, define \emph{the minimum expansion factor} $K_{\mathcal{C}}^{*}$ to represent the infimum of the set of extension factors of $\mathcal{C}$. Each $\mathcal{C}$ has a unique corresponding $K_{\mathcal{C}}^{*}$, and the smaller $K_{\mathcal{C}}^{*}$ is, the better the compression performance of $\mathcal{C}$ is. A class of UCI $\mathcal{C}$ (or family $\{\mathcal{C}_i\}_{i=1}^{\infty}$) achieving the smallest $K_{\mathcal{C}}^{*}$ is defined as the \emph{optimal UCI}. The best result currently is that the range of $C_{\mathcal{C}}^{*}$ for the optimal UCI is $2\leq C_{\mathcal{C}}^{*}\leq 2.5$. In this paper, we prove that there exists a class of near-optimal UCIs, called $ν$ code, to achieve $K_ν=2.0386$. This narrows the range of the minimum expansion factor for optimal UCI to $2\leq C_{\mathcal{C}}^{*}\leq 2.0386$. Another new class of UCI, called $Δδ$ code, is specifically constructed. We show that the $Δδ$ code and $ν$ code are currently optimal in terms of minimum expansion factor. In addition, we propose a new proof that shows the minimum expansion factor of the optimal UCI is lower bounded by $2$.Open AccessThe Construction of Near-optimal Universal Coding of Integers
Universal Coding of Integers (UCI) is suitable for discrete memoryless sources with unknown probability distributions and infinitely countable alphabet sizes. The UCI is a class of prefix codes, such that the ratio of the average codeword length to $\max\{1, H(P)\}$ is within a constant expansion factor $K_{\mathcal{C}}$ for any decreasing probability distribution $P$, where $H(P)$ is the entropy of $P$. For any UCI code $\mathcal{C}$, define \emph{the minimum expansion factor} $K_{\mathcal{C}}^{*}$ to represent the infimum of the set of extension factors of $\mathcal{C}$. Each $\mathcal{C}$ has a unique corresponding $K_{\mathcal{C}}^{*}$, and the smaller $K_{\mathcal{C}}^{*}$ is, the better the compression performance of $\mathcal{C}$ is. A class of UCI $\mathcal{C}$ (or family $\{\mathcal{C}_i\}_{i=1}^{\infty}$) achieving the smallest $K_{\mathcal{C}}^{*}$ is defined as the \emph{optimal UCI}. The best result currently is that the range of $C_{\mathcal{C}}^{*}$ for the optimal UCI is $2\leq C_{\mathcal{C}}^{*}\leq 2.5$. In this paper, we prove that there exists a class of near-optimal UCIs, called $ν$ code, to achieve $K_ν=2.0386$. This narrows the range of the minimum expansion factor for optimal UCI to $2\leq C_{\mathcal{C}}^{*}\leq 2.0386$. Another new class of UCI, called $Δδ$ code, is specifically constructed. We show that the $Δδ$ code and $ν$ code are currently optimal in terms of minimum expansion factor. In addition, we propose a new proof that shows the minimum expansion factor of the optimal UCI is lower bounded by $2$. - 5 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (10) , 8587-8595
On Some Properties for Universal Coding of Integers and Its Generalization
In the field of lossless source coding, universal coding of integers (UCI) and generalized universal coding of integers (GUCI) are binary codes that are suitable for probability distributions without prior knowledge. UCI C is defined as a prefix coding in which the constant expansion factor KC times max{1,H(P)} is greater than or equal to the expected codeword length, where P is the decreasing probability distribution of the source and H(P) is the entropy of P. Since P is decreasing, when the set of codewords of the prefix code C is determined, the length of the n+1-th codeword of the prefix code C is greater than or equal to the length of the n-th codeword for any positive integer n, at which time the expected codeword length of C is minimized, and C is said to be minimal. GUCI G is defined as a prefix variable-to-variable length (VV) coding for which the constant expansion factor KG times H(P) is greater than or equal to the coding rate. In this paper, we prove two important theorems for UCI. First, we provide and prove the necessary and sufficient conditions for a minimal prefix code to be UCI. Second, we provide the first proof of an essential theorem for VV codes. This theorem can reveal the connection between UCI and GUCI and prove the converse part of Shannon’s first theorem concerning VV codes.
- 5 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (10) , 8587-8595
On Some Properties for Universal Coding of Integers and Its Generalization
In the field of lossless source coding, universal coding of integers (UCI) and generalized universal coding of integers (GUCI) are binary codes that are suitable for probability distributions without prior knowledge. UCI C is defined as a prefix coding in which the constant expansion factor KC times max{1,H(P)} is greater than or equal to the expected codeword length, where P is the decreasing probability distribution of the source and H(P) is the entropy of P. Since P is decreasing, when the set of codewords of the prefix code C is determined, the length of the n+1-th codeword of the prefix code C is greater than or equal to the length of the n-th codeword for any positive integer n, at which time the expected codeword length of C is minimized, and C is said to be minimal. GUCI G is defined as a prefix variable-to-variable length (VV) coding for which the constant expansion factor KG times H(P) is greater than or equal to the coding rate. In this paper, we prove two important theorems for UCI. First, we provide and prove the necessary and sufficient conditions for a minimal prefix code to be UCI. Second, we provide the first proof of an essential theorem for VV codes. This theorem can reveal the connection between UCI and GUCI and prove the converse part of Shannon’s first theorem concerning VV codes.
- 19 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (5) , 3473-3488
Parallel Welch–Berlekamp Algorithm
This paper presents new variants of the Welch-Berlekamp algorithm that are favorable to hardware implementation. First, we derive the parallel Welch-Berlekamp (PWB) algorithm in a constructive manner based on the properties of solutions to the rational interpolation problem. The algorithm features the simultaneously performed discrepancy computation and polynomial update. Second, we explore the early-termination mechanism of the PWB algorithm for decoding of Reed-Solomon (RS) codes. By introducing the concept of incomplete error locator polynomial, we show that if $e \leq t$ (where e is the number of errors and t is the error correction capability), the PWB algorithm can be terminated at latest at the completion of the $(t+ e)$ -th iteration. This leads to the early-terminating PWB (EPWB) algorithm. Finally, we develop frequency-domain versions of the PWB and EPWB algorithms, namely, FPWB and FEPWB. The key point toward the two algorithms is to replace the update of polynomial coefficients with the update of polynomial evaluations. It is worth noting that the FEPWB algorithm applies only to shortened RS codes. Furthermore, an efficient systolic architecture for the FPWB algorithm is designed, which is easily adapted for the FEPWB algorithm.
- 19 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (5) , 3473-3488
Parallel Welch–Berlekamp Algorithm
This paper presents new variants of the Welch-Berlekamp algorithm that are favorable to hardware implementation. First, we derive the parallel Welch-Berlekamp (PWB) algorithm in a constructive manner based on the properties of solutions to the rational interpolation problem. The algorithm features the simultaneously performed discrepancy computation and polynomial update. Second, we explore the early-termination mechanism of the PWB algorithm for decoding of Reed-Solomon (RS) codes. By introducing the concept of incomplete error locator polynomial, we show that if $e \leq t$ (where e is the number of errors and t is the error correction capability), the PWB algorithm can be terminated at latest at the completion of the $(t+ e)$ -th iteration. This leads to the early-terminating PWB (EPWB) algorithm. Finally, we develop frequency-domain versions of the PWB and EPWB algorithms, namely, FPWB and FEPWB. The key point toward the two algorithms is to replace the update of polynomial coefficients with the update of polynomial evaluations. It is worth noting that the FEPWB algorithm applies only to shortened RS codes. Furthermore, an efficient systolic architecture for the FPWB algorithm is designed, which is easily adapted for the FEPWB algorithm.
- Open Access
A Fast Decoding Algorithm for Generalized Reed-Solomon Codes and Alternant Codes
In this paper, it is shown that the syndromes of generalized Reed-Solomon (GRS) codes and alternant codes can be characterized in terms of inverse fast Fourier transform, regardless of code definitions. Then a fast decoding algorithm is proposed, which has a computational complexity of $O(n\log(n-k) + (n-k)\log^2(n-k))$ for all $(n,k)$ GRS codes and $(n,k)$ alternant codes. Particularly, this provides a new decoding method for Goppa codes, which is an important subclass of alternant codes. When decoding the binary Goppa code with length $8192$ and correction capability $128$, the new algorithm is nearly 10 times faster than traditional methods. The decoding algorithm is suitable for the McEliece cryptosystem, which is a candidate for post-quantum cryptography techniques.Open AccessA Fast Decoding Algorithm for Generalized Reed-Solomon Codes and Alternant Codes
In this paper, it is shown that the syndromes of generalized Reed-Solomon (GRS) codes and alternant codes can be characterized in terms of inverse fast Fourier transform, regardless of code definitions. Then a fast decoding algorithm is proposed, which has a computational complexity of $O(n\log(n-k) + (n-k)\log^2(n-k))$ for all $(n,k)$ GRS codes and $(n,k)$ alternant codes. Particularly, this provides a new decoding method for Goppa codes, which is an important subclass of alternant codes. When decoding the binary Goppa code with length $8192$ and correction capability $128$, the new algorithm is nearly 10 times faster than traditional methods. The decoding algorithm is suitable for the McEliece cryptosystem, which is a candidate for post-quantum cryptography techniques. - 1 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (5) , 2906-2920
Vector Locally Repairable Codes With Small Repair Bandwidth and Small Sub-Packetization Levels
Maximum distance separable (MDS) codes in distributed storage systems provide the optimal tradeoff between fault tolerance and storage overhead. As a kind of MDS codes, minimum storage regenerating (MSR) codes have attracted a lot of attention since they are also optimal in terms of repair bandwidth. However, MSR codes suffer from a high repair degree, meaning many helper nodes are needed in the node repair process. Compared to MSR codes, locally repairable codes (LRCs) can significantly reduce the repair degree at the cost of increased storage overhead. The recently introduced concept of vector LRCs combines the advantages of MSR codes and LRCs, providing a tradeoff between repair degree/repair bandwidth and storage overhead. Most existing vector LRCs are built on MSR codes or their shortened versions. However, existing MSR codes have an unavoidably large sub-packetization levels, which also result in large sub-packetization levels in the corresponding vector LRCs. In this paper, we propose a new vector LRC structure, where MDS array codes (without shortening) can be employed as the local codes. Based this new structure, we propose three constructions of vector LRCs with small sub-packetization levels and small repair bandwidth, whose required field sizes are comparable to the code lengths. Additionally, the first two constructions offer a flexible tradeoff between the sub-packetization level and the repair bandwidth, while the third construction has a sub-packetization level of 2, making it easy to implement. Compared to existing vector LRCs, the new vector LRCs provide significantly smaller sub-packetization levels and support a wider range of parameters.
- 1 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (5) , 2906-2920
Vector Locally Repairable Codes With Small Repair Bandwidth and Small Sub-Packetization Levels
Maximum distance separable (MDS) codes in distributed storage systems provide the optimal tradeoff between fault tolerance and storage overhead. As a kind of MDS codes, minimum storage regenerating (MSR) codes have attracted a lot of attention since they are also optimal in terms of repair bandwidth. However, MSR codes suffer from a high repair degree, meaning many helper nodes are needed in the node repair process. Compared to MSR codes, locally repairable codes (LRCs) can significantly reduce the repair degree at the cost of increased storage overhead. The recently introduced concept of vector LRCs combines the advantages of MSR codes and LRCs, providing a tradeoff between repair degree/repair bandwidth and storage overhead. Most existing vector LRCs are built on MSR codes or their shortened versions. However, existing MSR codes have an unavoidably large sub-packetization levels, which also result in large sub-packetization levels in the corresponding vector LRCs. In this paper, we propose a new vector LRC structure, where MDS array codes (without shortening) can be employed as the local codes. Based this new structure, we propose three constructions of vector LRCs with small sub-packetization levels and small repair bandwidth, whose required field sizes are comparable to the code lengths. Additionally, the first two constructions offer a flexible tradeoff between the sub-packetization level and the repair bandwidth, while the third construction has a sub-packetization level of 2, making it easy to implement. Compared to existing vector LRCs, the new vector LRCs provide significantly smaller sub-packetization levels and support a wider range of parameters.
- 19 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (12) , 8447-8461
High-Capacity Framework for Reversible Data Hiding Using Asymmetric Numeral Systems
Reversible data hiding (RDH) has been extensively studied in the field of multimedia security. Embedding capacity is an important metric for RDH performance evaluation. However, the embedding capacity of existing methods for independent and identically distributed (i.i.d.) gray-scale signals is still not good enough. In this paper, we propose a high-capacity RDH code construction method that employs asymmetric numeral systems (ANS) coding as the underlying coding framework. Based on the proposed framework, two RDH methods are presented. First, we propose a static RDH method that takes the constant host probability mass function (PMF) as input parameters and offers high embedding performance. Then, we give a dynamic RDH method that can eliminate the need for transmitting the host PMF in advance by designing a reversible dynamic probability calculator. The simulation results on discrete normally distributed signals demonstrate that the performance of the proposed static method is very close to the expected rate-distortion bound, and the proposed dynamic method can achieve satisfactory embedding capacity without prior knowledge of host PMF at the cost of slightly sacrificing steganographic data quality. Moreover, the experimental results on gray-scale images show that the proposed static method provides higher peak signal-to-noise ratio (PSNR) values and larger embedding capacities than some state-of-the-art methods, e.g., the embedding capacity of image Lena is as high as 3.571 bits per pixel.
- 19 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (12) , 8447-8461
High-Capacity Framework for Reversible Data Hiding Using Asymmetric Numeral Systems
Reversible data hiding (RDH) has been extensively studied in the field of multimedia security. Embedding capacity is an important metric for RDH performance evaluation. However, the embedding capacity of existing methods for independent and identically distributed (i.i.d.) gray-scale signals is still not good enough. In this paper, we propose a high-capacity RDH code construction method that employs asymmetric numeral systems (ANS) coding as the underlying coding framework. Based on the proposed framework, two RDH methods are presented. First, we propose a static RDH method that takes the constant host probability mass function (PMF) as input parameters and offers high embedding performance. Then, we give a dynamic RDH method that can eliminate the need for transmitting the host PMF in advance by designing a reversible dynamic probability calculator. The simulation results on discrete normally distributed signals demonstrate that the performance of the proposed static method is very close to the expected rate-distortion bound, and the proposed dynamic method can achieve satisfactory embedding capacity without prior knowledge of host PMF at the cost of slightly sacrificing steganographic data quality. Moreover, the experimental results on gray-scale images show that the proposed static method provides higher peak signal-to-noise ratio (PSNR) values and larger embedding capacities than some state-of-the-art methods, e.g., the embedding capacity of image Lena is as high as 3.571 bits per pixel.