111 citations · 308 across the 46 of their papers we have counts for
46 papers
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…
Distributed Quantized Detection of Sparse Signals Under Byzantine Attacks
Chen Quan, Yunghsiang S. Han, Baocheng Geng +1
This paper investigates distributed detection of sparse stochastic signals with quantized measurements under Byzantine attacks. Under this type of attack, sensors in the networks m…
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…