Packet-level Reed-Solomon codes over burst-loss channels

Che, Hui; Bai, Yong; Feng, Chunkang

doi:10.1109/icct.2012.6511211

Cited by 1 publication

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed protocol makes use of an erasure-correcting code to encode the transmitted packets. This subsection introduces the Packet-level Reed-Solomon (PRS) code [24]. A (n, k) PRS code over a Galois field GF(2 m ) consists of k message packets and r = n − k parity packets, and 2 m > n. As shown in Figure 5, a (n, k) PRS code can be viewed as a (P/m) × n matrix over GF(2 m ), where each column is a Pbit packet, and each row is a codeword of (n, k) RS codes.…”

Section: A Packet-level Reed-solomon Codesmentioning

confidence: 99%

Reducing the Bandwidth of Block Propagation in Bitcoin Network With Erasure Coding

2019

View full text Add to dashboard Cite

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 bandwidth of block propagation with erasure coding. To begin with, the network nodes are classified into several clusters. When a node wants to propagate a block, the node does not need to propagate the whole information of the block. Instead, the node can only transmit the transaction IDs and the coded information to each cluster. The simulation shows that the proposed method can significantly ease the network traffic among these clusters.INDEX TERMS Blockchain, block propagation, clustering evaluation.

show abstract

Section: A Packet-level Reed-solomon Codesmentioning

confidence: 99%