111 citations · 308 across the 46 of their papers we have counts for
31 papers · 1 filter
A Construction of Evolving -threshold Secret Sharing Scheme over A Polynomial Ring
Qi Cheng, Hongru Cao, Sian-Jheng Lin +1
The threshold secret sharing scheme allows the dealer to distribute the share to every participant such that the secret is correctly recovered from a certain amount of shares. The…
Variant Codes Based on A Special Polynomial Ring and Their Fast Computations
Leilei Yu, Yunghsiang S. Han, Jiasheng Yuan +1
Binary array codes are widely used in storage systems to prevent data loss, such as the Redundant Array of Independent Disks~(RAID). Most designs for such codes, such as Blaum-Roth…
A Complete Proof of an Important Theorem for Variable-to-Variable Length Codes
Wei Yan, Yunghsiang S. Han
Variable-to-variable length (VV) codes are a class of lossless source coding. As their name implies, VV codes encode a variable-length sequence of source symbols into a variable-le…
MDS Array Codes With Small Sub-packetization Levels and Small Repair Degrees
Jie Li, Yi Liu, Xiaohu Tang +3
High-rate minimum storage regenerating (MSR) codes are known to require a large sub-packetization level, which can make meta-data management difficult and hinder implementation in…
MDS Array Codes With (Near) Optimal Repair Bandwidth for All Admissible Repair Degrees
Jie Li, Yi Liu, Xiaohu Tang +3
Abundant high-rate (n, k) minimum storage regenerating (MSR) codes have been reported in the literature. However, most of them require contacting all the surviving nodes during a n…
PMDS Array Codes With Small Sub-packetization, Small Repair Bandwidth/Rebuilding Access
Jie Li, Xiaohu Tang, Hanxu Hou +3
Partial maximum distance separable (PMDS) codes are a kind of erasure codes where the nodes are divided into multiple groups with each forming an MDS code with a smaller code lengt…
New Decoding of Reed-Solomon Codes Based on FFT and Modular Approach
Nianqi Tang, Yunghsiang S. Han
Decoding algorithms for Reed--Solomon (RS) codes are of great interest for both practical and theoretical reasons. In this paper, an efficient algorithm, called the modular approac…
The Story of : ALOHA-based and Reinforcement-Learning-based Random Access for Delay-Constrained Communications
Lei Deng, Danzhou Wu, Jing Deng +2
Motivated by the proliferation of real-time applications in multimedia communication systems, tactile Internet, and cyber-physical systems, supporting delay-constrained traffic bec…
Two New Piggybacking Designs with Lower Repair Bandwidth
Zhengyi Jiang, Hanxu Hou, Yunghsiang S. Han +3
Piggybacking codes are a special class of MDS array codes that can achieve small repair bandwidth with small sub-packetization by first creating some instances of an MDS co…
A Generalization of Array Codes with Local Properties and Efficient Encoding/Decoding
Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee +3
A maximum distance separable (MDS) array code is composed of arrays such that any out of columns suffice to retrieve all the information symbols. Expanded…
Lower Bound on the Optimal Access Bandwidth of ()-MDS Array Code with Degraded Read Friendly
Ting-Yi Wu, Yunghsiang S. Han, Zhengrui Li +4
Accessing the data in the failed disk (degraded read) with low latency is crucial for an erasure-coded storage system. In this work, the maximum distance separable (MDS) array code…
Decoder Ties Do Not Affect the Error Exponent of the Memoryless Binary Symmetric Channel
Ling-Hua Chang, Po-Ning Chen, Fady Alajaji +1
The generalized Poor-Verdu error lower bound established in [1] for multihypothesis testing is studied in the classical channel coding context. It is proved that for any sequence o…
The Asymptotic Generalized Poor-Verdu Bound Achieves the BSC Error Exponent at Zero Rate
Ling-Hua Chang, Po-Ning Chen, Fady Alajaji +1
The generalized Poor-Verdu error lower bound for multihypothesis testing is revisited. Its asymptotic expression is established in closed-form as its tilting parameter grows to inf…
Multi-Layer Transformed MDS Codes with Optimal Repair Access and Low Sub-Packetization
Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han
An maximum distance separable (MDS) code has optimal repair access if the minimum number of symbols accessed from surviving nodes is achieved, where .…
On the Exact Lower Bounds of Encoding Circuit Sizes of Hamming Codes and Hadamard Codes
Zhengrui Li, Sian-Jheng Lin, Yunghsiang S. Han
In this paper, we investigate the encoding circuit size of Hamming codes and Hadamard codes. To begin with, we prove the exact lower bound of circuit size required in the encoding…
A Unified Form of EVENODD and RDP Codes and Their Efficient Decoding
Hanxu Hou, Yunghsiang S. Han, Kenneth W. Shum +1
Array codes have been widely employed in storage systems, such as Redundant Arrays of Inexpensive Disks (RAID). The row-diagonal parity (RDP) codes and EVENODD codes are two popula…
A New Design of Binary MDS Array Codes with Asymptotically Weak-Optimal Repair
Hanxu Hou, Yunghsiang Han, Patrick P. C. Lee +2
Binary maximum distance separable (MDS) array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundan…
On the Maximum Size of Block Codes Subject to a Distance Criterion
Ling-Hua Chang, Po-Ning Chen, Vincent Y. F. Tan +2
We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than . The achievability argument involves an iterative c…
Cauchy MDS Array Codes With Efficient Decoding Method
Hanxu Hou, Yunghsiang S. Han
Array codes have been widely used in communication and storage systems. To reduce computational complexity, one important property of the array codes is that only XOR operation is…
FFT Algorithm for Binary Extension Finite Fields and its Application to Reed-Solomon Codes
Sian-Jheng Lin, Tareq Y. Al-Naffouri, Yunghsiang S. Han
Recently, a new polynomial basis over binary extension fields was proposed such that the fast Fourier transform (FFT) over such fields can be computed in the complexity of order $\…
Maximum-likelihood Soft-decision Decoding for Binary Linear Block Codes Based on Their Supercodes
Yunghsiang S. Han, Hung-Ta Pai, Po-Ning Chen +1
Based on the notion of supercodes, we propose a two-phase maximum-likelihood soft-decision decoding (tpMLSD) algorithm for binary linear block codes in this work. The first phase a…
Permutation Trellis Coded Multi-level FSK Signaling to Mitigate Primary User Interference in Cognitive Radio Networks
Raghed El-Bardan, Engin Masazade, Onur Ozdemir +2
We employ Permutation Trellis Code (PTC) based multi-level Frequency Shift Keying signaling to mitigate the impact of Primary Users (PUs) on the performance of Secondary Users (SUs…
Novel Polynomial Basis and Its Application to Reed-Solomon Erasure Codes
Sian-Jheng Lin, Wei-Ho Chung, Yunghsiang S. Han
In this paper, we present a new basis of polynomial over finite fields of characteristic two and then apply it to the encoding/decoding of Reed-Solomon erasure codes. The proposed…
Distributed Bayesian Detection with Byzantine Data
Bhavya Kailkhura, Yunghsiang S. Han, Swastik Brahma +1
In this paper, we consider the problem of distributed Bayesian detection in the presence of Byzantines in the network. It is assumed that a fraction of the nodes in the network are…