Polynomial Codes Over Certain Finite Fields

Reed, I. S.; Solomon, G.

doi:10.1137/0108018

Cited by 2,839 publications

(1,505 citation statements)

References 2 publications

Supporting

Mentioning

1,408

Contrasting

Unclassified

Order By: Relevance

“…In general, FEC in application layer is called Application Layer FEC (AL-FEC) and a variety of FEC algorisms are used for AL-FEC such as Reed-Solomon [28], LDPC [29], LDGM [2], and Raptor Code [30]. ReedSolomon is used for many distributed storage systems such as RAID [4], Ocean Store [26], and RobuSTore [24].…”

Section: Discussion and Related Workmentioning

confidence: 99%

Content Espresso: A Distributed Large File Sharing System for Digital Content Productions

Ando

Teraoka

Kaneko

2017

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

Daisuke ANDO †a) , Fumio TERAOKA † †b) , and Kunitake KANEKO † †c) , Members SUMMARYWith rapid growth of producing high-resolution digital contents such as Full HD, 4K, and 8K movies, the demand for low cost and high throughput sharing of content files is increasing at digital content productions. In order to meet this demand, we have proposed DRIP (Distributed chunks Retrieval and Integration Procedure), a storage and retrieval mechanism for large file sharing using forward error correction (FEC) and global dispersed storage. DRIP was confirmed that it contributes to low cost and high throughput sharing. This paper describes the design and implementation of Content Espresso, a distributed large file sharing system for digital content productions using DRIP, and presents performance evaluations. We set up experimental environment using 79 physical machines including 72 inexpensive storage servers, and evaluate file metadata access performance, file storage/retrieval performance, FEC block size, and system availability by emulating global environments. The results confirm that Content Espresso has capability to deal with 15,000 requests per second, achieves 1 Gbps for file storage, and achieves more than 3 Gbps for file retrieval. File storage and retrieval performance are not significantly affected by the network conditions. Thus, we conclude that Content Espresso is capable of a global scale file sharing system for digital content productions. key words: distributed storage system, UDP data transmission, FEC, file sharing

show abstract

Section: Discussion and Related Workmentioning

confidence: 99%

Content Espresso: A Distributed Large File Sharing System for Digital Content Productions

Ando

Teraoka

Kaneko

2017

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…Figs. [18][19][20] show that the exponential approximation is accurate, and gives a lower bound for other distributions. Using a heavy-tailed distribution the proportion of short lived nodes is high, but they have fewer children upon their departure, hence their impact is lower on E[∆].…”

Section: Performance Evaluation: Node Churnmentioning

confidence: 99%

“…For this simple example we do not need an iterative solution, but we can substitute (20) into (21), and solve for P(V 1 = 1) and P(V 2 = 1). For example, for p = 0.1 we get P(V 1 = 1) = 0.9764 and P(V 2 = 1) = 0.9714.…”

Section: Examplementioning

confidence: 99%

“…The source uses block based FEC, e.g., Reed-Solomon codes [20], so that nodes can recover from packet losses due to network congestion and node departures. To every k consecutive packets of information c packets of redundant information are added resulting in a block length of n = k + c. We denote this FEC scheme by FEC(n,k).…”

Section: Data Transmission and Error Resiliencementioning

confidence: 99%

See 1 more Smart Citation

Stability and performance of overlay multicast systems employing forward error correction

Dán¹,

Fodor²

2010

Performance Evaluation

View full text Add to dashboard Cite

The two main sources of impairment in overlay multicast systems are packet losses and node churn. Yet, little is known about their effects on the data distribution performance. In this paper we develop an analytical model of a large class of peer-to-peer streaming architectures based on decomposition and non-linear recurrence relations. We analyze the stability properties of these systems using fixed-point analysis. We derive bounds on the probability that nodes in the overlay receive an arbitrary packet of the stream. Based on the model, we explain the effects of the overlay's size, node heterogeneity, loss correlations and node churn on the overlay's performance. Our findings lead us to the definition of an overlay structure with improved stability properties. We show how and under what conditions overlays can benefit from the use of error control solutions, prioritization and taxation schemes. Based on our results, we identify the components that are needed to achieve good data distribution performance in multi-tree-based overlay multicast.

show abstract

“…Furthermore, QR codes are readable from different angles and the data can be decoded successfully even if the code is partially covered or damaged [12]. This is because of robust error correction that is based on Reed-Solomon Codes [19]. There are four different error correction levels namely L(Low 7%), M(Medium 15%), Q(Quartile 25%) and H(High 30%) Error correction level L tolerates up to 7% unreadable modules respectively [31].…”

Section: The Qr Code Standardmentioning

confidence: 99%

QR Code Security: A Survey of Attacks and Challenges for Usable Security

Krombholz

Frühwirt

Kieseberg

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. QR (Quick Response) codes are two-dimensional barcodes with the ability to encode different types of information. Because of their high information density and robustness, QR codes have gained popularity in various fields of application. Even though they offer a broad range of advantages, QR codes pose significant security risks. Attackers can encode malicious links that lead e.g. to phishing sites. Such malicious QR codes can be printed on small stickers and replace benign ones on billboard advertisements. Although many real world examples of QR code based attacks have been reported in the media, only little research has been conducted in this field and almost no attention has been paid on the interplay of security and human-computer interaction. In this work, we describe the manifold use cases of QR codes. Furthermore, we analyze the most significant attack scenarios with respect to the specific use cases. Additionally, we systemize the research that has already been conducted and identified usable security and security awareness as the main research challenges. Finally we propose design requirements with respect to the QR code itself, the reader application and usability aspects in order to support further research into to making QR code processing both secure and usable.

show abstract

Polynomial Codes Over Certain Finite Fields

Cited by 2,839 publications

References 2 publications

Content Espresso: A Distributed Large File Sharing System for Digital Content Productions

Content Espresso: A Distributed Large File Sharing System for Digital Content Productions

Stability and performance of overlay multicast systems employing forward error correction

QR Code Security: A Survey of Attacks and Challenges for Usable Security

Contact Info

Product

Resources

About