A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
A Novel Decoding Method for the Erasure Codes
2021
Security and Communication Networks
Preserved Fulltext
The erasure codes are widely used in the distributed storage with low redundancy compared to the replication method. ...
However, the current research studies about the erasure codes mainly focus on the encoding methods, while there are few studies on the decoding methods. ...
□
The Proposed Decoding Method for the Erasure Codes In this paper, we will propose a novel decoding method mainly for the erasure codes in the storage system, such as RS code and array codes. e proposed ...
doi:10.1155/2021/8755697
fatcat:o63idr4ukbgazomjmrltntu7k4
Numerically Stable Real Number Codes Based on Random Matrices
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
However, most real-number and complex-number codes in literature are quite suspect in their numerical stability. ...
Error correction codes defined over realnumber and complex-number fields have been studied and recognized as useful in many applications. ...
Actually, for any burst erasures of ¾¼ elements in Ý, none of the above codes could reconstruct an acceptable Ü.
V. ...
doi:10.1007/11428831_15
fatcat:2fd77rqjsjbnxbb4g75ld2cmc4
On the Confidentiality of Information Dispersal Algorithms and Their Erasure Codes
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
For an IDA that adopts an arbitrary non-systematic erasure code, its confidentiality may fall into weak confidentiality. ...
Information Dispersal Algorithms (IDAs) have been widely applied to reliable and secure storage and transmission of data files in distributed systems. ...
code. The reliability of an IDA is clear: no more than n − m lost pieces of the n pieces F 1 , F 2 , · · · , F n will not result in data loss. ...
arXiv:1206.4123v2
fatcat:lbamrnmlevbkflis3x4vhaykfe
Compressive Oversampling for Robust Data Transmission in Sensor Networks
2010
2010 Proceedings IEEE INFOCOM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose that if CS is employed for source compression, then CS can further be exploited as an application layer erasure coding strategy for recovering missing data. ...
We show that CS erasure encoding (CSEC) with random sampling is efficient for handling missing data in erasure channels, paralleling the performance of BCH codes, with the added benefit of graceful degradation ...
This is in contrast to traditional erasure coding schemes that necessitate that the matrix Ω C be invertible for any reconstruction to occur. ...
doi:10.1109/infcom.2010.5461926
dblp:conf/infocom/CharbiwalaCZKHBS10
fatcat:flvnpznun5cs3lw5q4npxzbffm
Lmi Based Design Of Optimal Precoder For Mimo Channels With Erasures
2012
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Publication in the conference proceedings of EUSIPCO, Bucharest, Romania, 2012 ...
The optimal correlating transform coding for a 2 × 2 coder for a quantized source is presented in [3, 4] . ...
Multiple description coding (MDC) has proven to be an effective method to recover the source signal after multiple erasures [3] . ...
doi:10.5281/zenodo.43045
fatcat:7ftiojxjorhmpc3zmuxpbdjnxy
RSECB: A Reed Solomon Erasure Coding System for Hadoop Clusters
2018
International Journal for Research in Applied Science and Engineering Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we propose a coding technique known as Reed Solomon Erasure Coding using Backblaze method (RSECB) for Hadoop data archival system for Hadoop clusters where RS (m+n; m) codes are employed ...
RSECB-Pipeline uses multiple data nodes in a Hadoop cluster for forming data archival pipeline. RSECB-Pipeline conveys the merged single key-value pair to a successive node's local key-value store. ...
use of Reed Solomon Erasure Coding using Backblaze method of matrix inversion. ...
doi:10.22214/ijraset.2018.3615
fatcat:hu6e5jvlmzazbbtxsidbo7k4p4
An Enhanced Erasure Code-Based Security Mechanism for Cloud Storage
2014
Mathematical Problems in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
To address the problem of data leakage caused by unreliable service providers and external cyber attacks, an enhanced erasure code-based security mechanism is proposed and elaborated in terms of four aspects ...
The key design issues, including data division, construction of generator matrix, data encoding, fragment naming, and data decoding, are also described in detail. ...
Erasure Code-Based Security Mechanism for Cloud Storage
Reed-Solomon Erasure Code. ...
doi:10.1155/2014/293214
fatcat:cht3tx37pjf5ngehn7lrwq2equ
Enhancing Availability of Data in Mixed Homomorphic Encryption in Cloud
2019
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
By applying the erasure code if in any case user data is loss, will be reconstructed which provide more security than existing system. ...
The user data may be loss in any reasons and user may not have any copy of data. The Existing system not focus on data loss. So in proposed work focus on availability of data by erasure code. ...
In proposed work the erasure code are used for availability of data in case of failure. A Reed-Solomon erasure code adds redundancy to the system to tolerate failures. ...
doi:10.5281/zenodo.3591017
fatcat:ytcz3bornrghtoowsjojjhm2oi
Efficient updates in highly available distributed random access memory
2006
12th International Conference on Parallel and Distributed Systems - (ICPADS'06)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Erasure codes provide space-optimal data redundancy to protect this type of storage from node unavailability. ...
The technique significantly improves on previous work in update speed and also allows for serializable updates to a bucket that is in the process of being recovered. ...
Related Work Using erasure codes for redundancy is a standard method in disk based storage. RAID Level 5 uses the m+1 simple parity code and RAID Level 6 a number of two-erasures correcting codes. ...
doi:10.1109/icpads.2006.41
dblp:conf/icpads/CieslickiSS06
fatcat:e2ioshrwlzhp7bp25r7aja3c6q
Joint Source-Channel Coding Based on Cosine-Modulated Filter Banks for Erasure-Resilient Signal Transmission
2005
EURASIP Journal on Advances in Signal Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In particular, for paraunitary filter banks, we show that the signal reconstruction methods derived from the filter bank theory and from coding theory are equivalent, even in the presence of quantization ...
Perfect reconstruction (PR) for the CMFB-based OFBs with erasures is proven for the case of erasure patterns for which PR depends only on the general structure of the code and not on the prototype filters ...
As both methods are equivalent, in the sequel, we consider only reconstruction based on the parapseudoinverse of the analysis matrix after erasures. ...
doi:10.1155/asp.2005.510
fatcat:ssv27stnxvajnhirrdjf4iohey
Aggrecode: Constructing route intersection for data reconstruction in erasure coded storage
2014
IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose an erasure coded storage system for data reconstruction, which uses the practical network topology to minimize the reconstruction transmission costs. ...
Node failures often occur in large-scale data centers today. Erasure coded storage system provides high data reliability via data reconstruction. ...
ACKNOWLEDGMENT We would like to thank the anonymous reviewers for their comments. This paper is supported in part by National Nature ...
doi:10.1109/infocom.2014.6848156
dblp:conf/infocom/ZhangLLHLL14
fatcat:zzczwpujirffzesgczieuhm2uu
Blockchain Data Sharing Query Scheme based on Threshold Secret Sharing
2022
Security and Communication Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
At the same time, the Blakley space plane equation coefficient matrix is used to segment the data to be uploaded to the blockchain. ...
It solves the problem that the data cannot be directly stored in the block due to their large size. It facilitates data uploading to the blockchain. ...
For the n × t-order erasure code matrix, when (n − t) pieces of data are lost or tampered with, the original data can still be recovered through the erasure code decoding mechanism. ...
doi:10.1155/2022/8996815
fatcat:xpzyp3cxdjcxxpkxio4li3skwe
A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems
2009
2009 29th IEEE International Conference on Distributed Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For erasure codes, generating a new piece requires the transmission of k pieces over the network, resulting in a k times higher reconstruction traffic as compared to replication. ...
In distributed storage systems, erasure codes represent an attractive solution to add redundancy to stored data while limiting the storage overhead. ...
A more complex method is represented by erasure codes: the data are processed in order to produce k + h pieces such that any k of them are sufficient to reconstruct the original file, then these pieces ...
doi:10.1109/icdcs.2009.14
dblp:conf/icdcs/DuminucoB09
fatcat:wyoluswqfvgn3ap27fy25vmxba
The CORE Storage Primitive: Cross-Object Redundancy for Efficient Data Repair & Access in Erasure Coded Storage
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
However, traditional erasure codes are inefficient on reading stored data in degraded environments (when nodes might be unavailable), and on replenishing lost data (vital for long term resilience). ...
Erasure codes are an integral part of many distributed storage systems aimed at Big Data, since they provide high fault-tolerance for low overheads. ...
Two recent academic prototypes -NCFS [28] and NCCloud [29] likewise explore the feasibility of applying network coding techniques for repairing lost data. ...
arXiv:1302.5192v4
fatcat:rwljkazcc5azfi7khqpsy7vc5i
Multiple Description Image Coder Using Correlating Transforms
2004
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Publication in the conference proceedings of EUSIPCO, Viena, Austria, 2004 ...
TRANSFORM CODING WITH ERASURES Let's start considering the coding-decoding cascade model shown in Figure 1 . ...
In this article a new compression scheme for images is proposed as a modification of widely adopted methods based on Discrete Cosine Transform (DCT). ...
doi:10.5281/zenodo.38579
fatcat:cy4khvg7crgpfbqujpkbusnbeq
« Previous
Showing results 1 — 15 out of 2,245 results