Match!
Sian-Jheng Lin
University of Science and Technology of China
Discrete mathematicsMathematicsComputer scienceDecoding methodsReed–Solomon error correction
44Publications
13H-index
486Citations
What is this?
Publications 53
Newest
#2Sian-Jheng LinH-Index: 13
Last. Hanxu HouH-Index: 8
view all 5 authors...
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 DSSs, is defined as the total amount of data symbols transferred in the network when the data symbols stored in a node are updated. This paper contains the following contributions. First, we establish the closed-form expression of the minimum update bandwidth attainable by irregular array codes. Second, after defining a c...
Last. Nenghai Yu (USTC: University of Science and Technology of China)H-Index: 34
view all 5 authors...
This article describes a fast Reed–Solomon encoding algorithm with four and seven parity symbols in between. First, we show that the syndrome of Reed–Solomon codes can be computed via the Reed–Muller transform. Based on this result, the fast encoding algorithm is then derived. Analysis shows that the proposed approach asymptotically requires 3 XORs per data bit, representing an improvement over previous algorithms. The simulation demonstrates that the performance of the proposed approach improve...
Source
#2Sian-Jheng Lin (USTC: University of Science and Technology of China)H-Index: 13
view all 2 authors...
LZ77 is a dictionary compression algorithm by replacing the repeating sequence with the addresses of the previous referenced data in the stream. To find out these repetition, the LZ77 encoder maintains a hashing table, which have to frequently calculate hash values during the encoding process. In this paper, we present a class of rolling hash functions, that can calculate multiple hash values via a carry-less multiplication instruction. Then the proposed hash function is implemented in LZ4, whic...
Source
#1Ming Jin (USTC: University of Science and Technology of China)
#2Xiaojiao Chen (USTC: University of Science and Technology of China)
Last. Sian-Jheng Lin (USTC: University of Science and Technology of China)H-Index: 13
view all 3 authors...
With the popularity of Bitcoin, there is a greater demand for the scalability of the Bitcoin blockchain, which is susceptible to the efficiency of block propagation. In the Bitcoin blockchain, efficient block propagation approach can reduce the computing power and the risk of forks. Meanwhile, larger blocks help to improve the throughput of transactions. Thus, the block propagation is a major issue of the scalability of the Bitcoin network. This paper introduces a method to reduce the required b...
Source
#1Xiaojiao Chen (USTC: University of Science and Technology of China)
#2Sian-Jheng Lin (USTC: University of Science and Technology of China)H-Index: 13
Last. Nenghai Yu (USTC: University of Science and Technology of China)
view all 3 authors...
The blockchain provides an immutable, transparent, and decentralized method for data storage. However, as the volume of data gradually increases, the public blockchain system requires significant storage space. Also the synchronization of blank nodes needs much transmission bandwidth. This paper introduces a method to compress the size of transactions in the Bitcoin blockchain by replacing hash pointers with index pointers. Simulations show that the proposed method can reduce the storage space o...
Source
#1Cheng Chen (USTC: University of Science and Technology of China)
#2Sian-Jheng Lin (USTC: University of Science and Technology of China)H-Index: 13
Last. Yu Nenghai (USTC: University of Science and Technology of China)H-Index: 4
view all 3 authors...
An irregular MDS array code is a class of array codes allowing unequal sizes of each columns. In this paper, two classes of irregular MDS array codes are proposed to reduce the number of parity symbols at certain cases. The first code is based on polynomial remainder codes, and the second code uses the code bundling method. In addition, a systematic encoding approach of the polynomial remainder code is also presented.
Source
Jul 1, 2019 in ISIT (International Symposium on Information Theory)
#1Zhengrui Li (USTC: University of Science and Technology of China)
#2Sian-Jheng Lin (USTC: University of Science and Technology of China)H-Index: 13
In this paper, we consider the update bandwidth in distributed storage systems. The update bandwidth is defined as the bandwidth when the data storage in a node is updated. The minimum update bandwidth for irregular array codes is provided. Further, we minimize the code redundancy when the update bandwidth is minimal. Finally, we introduce a class of vertical MDS codes that minimizes both update bandwidth and code redundancy.
Source
#1Hongru Cao (USTC: University of Science and Technology of China)
#2Sian-Jheng Lin (USTC: University of Science and Technology of China)H-Index: 13
Last. Yunghsiang S. Han (DGUT: Dongguan University of Technology)H-Index: 24
view all 4 authors...
Secret sharing is the method to share secrets among a group of shares, and the secret can be reconstructed if one obtains a predefined number of shares. The polynomial secret sharing is usually constructed over a field. In this letter, a novel polynomial secret sharing over a ring is proposed. In particular, by choosing a certain ring, the fast Fourier transform can be applied on the encoding of secret sharing. The analysis shows that the proposed secret sharing scheme requires O(N\log _2 N)B...
Source
#1Sian-Jheng Lin (USTC: University of Science and Technology of China)H-Index: 13
#2Yunghsiang S. Han (DGUT: Dongguan University of Technology)H-Index: 24
Last. Nenghai Yu (USTC: University of Science and Technology of China)
view all 3 authors...
Locally decodable codes and locally correctable codes (LCCs) have several important applications, such as private information retrieval, secure multiparty computation, and circuit lower bounds. Three major parameters are considered in LCCs: query complexity, message length, and codeword length. The most familiar LCCs in the regime of low query complexity are the generalized Reed–Muller (GRM) codes. However, it has not previously been determined whether there exist codes that have shorter codewor...
Source
#1Dongdong Hou (USTC: University of Science and Technology of China)H-Index: 5
#2Weiming Zhang (USTC: University of Science and Technology of China)H-Index: 21
Last. Yu Nenghai (USTC: University of Science and Technology of China)H-Index: 4
view all 5 authors...
Different from all the previous reversible data hiding schemes, a completely novel one for the color image is proposed, which reversibly embeds messages into the color host image without modifying its corresponding gray version. The property of grayscale invariance is valuable, because many applications and image processing algorithms for color images are based on the corresponding gray versions, such as black and white printing, producing reading materials for color blind people, single-channel...
9 CitationsSource
123456