7 papers
A Construction of Evolving -threshold Secret Sharing Scheme with Perfect Security and Smaller Share Size
Qi Cheng, Hongru Cao, Sian-Jheng Lin
The evolving -threshold secret sharing scheme allows the dealer to distribute the secret to many participants such that only no less than shares together can restore the sec…
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…
A New Metric and Its Scheme Construction for Evolving -Threshold Secret Sharing Schemes
Wei Yan, Sian-Jheng Lin
Evolving secret sharing schemes do not require prior knowledge of the number of parties and may be infinitely countable. It is known that the evolving -threshold secret…
A Tighter Upper Bound of the Expansion Factor for Universal Coding of Integers and Its Code Constructions
Wei Yan, Sian-Jheng Lin
In entropy coding, universal coding of integers~(UCI) is a binary universal prefix code, such that the ratio of the expected codeword length to is less than or eq…
Update Bandwidth for Distributed Storage
Zhengrui Li, Sian-Jheng Lin, Po-Ning Chen +2
In this paper, we consider the update bandwidth in distributed storage systems~(DSSs). The update bandwidth, which measures the transmission efficiency of the update process in DSS…
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…