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.
Filters
Erasures vs. Errors in Local Decoding and Property Testing
2018
Innovations in Theoretical Computer Science
Preserved Fulltext
We initiate the study of the role of erasures in local decoding and use our understanding to prove a separation between erasure-resilient and tolerant property testing. ...
Motivated by applications in property testing, we begin our investigation with local list decoding in the presence of erasures. ...
I T C S 2 0 1 9
63:6 Erasures vs. Errors in Local Decoding and Property Testing Separation. ...
doi:10.4230/lipics.itcs.2019.63
dblp:conf/innovations/RaskhodnikovaRV19
fatcat:bfbm2dpuvfcb5gi6ddl6gfrbdi
Quantum coding with low-depth random circuits
[article]
2021
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 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Here, we use ensembles of low-depth random circuits with local connectivity in D≥ 1 spatial dimensions to generate quantum error-correcting codes. ...
We then study the critical behavior of the erasure threshold in the so-called moderate deviation limit, where both the failure probability and the distance to the optimal threshold converge to zero with ...
In contrast to our analysis of the stabilizer codes, we do not perform an optimal decoding analysis and only test for the existence of an erasure threshold. ...
arXiv:2010.09775v2
fatcat:exav7k34f5aolkafr27jsb7lnq
Machine Learning for Error Correction with Natural Redundancy
[article]
2019
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.
The second approach, called Representation-Aware, assumes that such knowledge is known and uses it for error correction. Furthermore, both approaches combine the decoding based on NR and ECCs. ...
It uses deep learning to detect file types accurately, and then mine Natural Redundancy for soft decoding. ...
TABLE I BIT I ERROR RATE (BER) VS TEST ACCURACY FOR FILE TYPE RECOGNITION (FTR). HERE THE "OVERALL TEST ACCURACY" IS FOR ALL 4 TYPES OF FILES TOGETHER. ...
arXiv:1910.07420v1
fatcat:c3lbr6lnzfexzfmkmdj5e2ucni
Joint source-chanel decoding of JPEG2000 images with unequal loss protection
2008
Proceedings of the IEEE International Conference on Acoustics, Speech and 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.
Some statistical results on the efficiency of this error-resilient decoding
method for error localization are presented in [10]. ...
Later in the thesis, we explain how this slightly improved error localization is particularly useful in decoding of the coding passes that are relatively long, and potentially perpetuate the joint decoding ...
doi:10.1109/icassp.2008.4517872
dblp:conf/icassp/BahmaniBH08
fatcat:ifingnr4pzab7ek46se4xw4s3e
Falcon Codes
2015
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15
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.
We introduce Falcon codes, a class of authenticated error correcting codes that are based on LT codes and achieve the following properties, for the first time simultaneously: (1) with high probability, ...
they can correct adversarial corruptions of an encoded message, and (2) they allow very efficient encoding and decoding times, even linear in the message length. ...
Acknowledgments Research supported in part by the National Science Foundation under grants CNS-1012060 and CNS-1228485. ...
doi:10.1145/2810103.2813728
dblp:conf/ccs/JuelsKTT15
fatcat:543brrm6nrdmljnlcu2zfio5we
RS + LDPC-Staircase codes for the erasure channel: Standards, usage and performance
2013
2013 IEEE 9th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)
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.
Finally we present the performances of these codes in terms of erasure correction capabilities and encoding/decoding speed, taking advantage of the 3GPP-eMBMS results where they have been ranked first. ...
Application-Level Forward Erasure Correction (AL-FEC) codes are a key element of telecommunication systems. ...
INTRODUCTION Erasure channels are characterized by the property that the transmitted data units are either received without error or are erased (lost). ...
doi:10.1109/wimob.2013.6673424
dblp:conf/wimob/RocaCTDL13
fatcat:x75zwahy65g6djttd7ugo7nhnm
Density Evolution for SUDOKU Codes on the Erasure Channel
[article]
2014
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.
Codes based on SUDOKU puzzles are discussed, and belief propagation decoding introduced for the erasure channel. ...
The belief propagation decoder for erasure channels operates by exchanging messages containing sets of possible values. ...
Convergence to cardinality 1 message is the equivalent to error-free decoding, and the threshold is the limit between error-free decoding and values of the erasure probability for which the decoding error ...
arXiv:1407.4328v1
fatcat:ji5dtsjh3fg6xauxmqv3fdtu2q
Density evolution for SUDOKU codes on the erasure channel
2014
2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)
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.
Codes based on SUDOKU puzzles are discussed, and belief propagation decoding introduced for the erasure channel. ...
The belief propagation decoder for erasure channels operates by exchanging messages containing sets of possible values. ...
Convergence to cardinality 1 message is the equivalent to error-free decoding, and the threshold is the limit between error-free decoding and values of the erasure probability for which the decoding error ...
doi:10.1109/istc.2014.6955120
dblp:conf/istc/AtkinsS14
fatcat:2ykp7ao2ovevhpzqn7w5mon7yi
A digital fountain approach to reliable distribution of bulk data
1998
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication - SIGCOMM '98
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 2003; you can also visit the original URL.
The file type is application/pdf.
Moreover, no feedback channels are needed to ensure reliable delivery, even in the face of high loss rates. ...
We develop a protocol that closely approximates a digital fountain using a new class of erasure codes that are orders of magnitude faster than standard erasure codes. ...
Table 1 : 1 Properties of Tornado vs. Reed-Solomon codes
Table 2 : 2 Comparison of encoding times for erasure codes. ...
doi:10.1145/285237.285258
dblp:conf/sigcomm/ByersLMR98
fatcat:xrg4grrv75gmzoq6mvrnwelbki
A digital fountain approach to reliable distribution of bulk data
1998
Computer communication review
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 2003; you can also visit the original URL.
The file type is application/pdf.
Moreover, no feedback channels are needed to ensure reliable delivery, even in the face of high loss rates. ...
We develop a protocol that closely approximates a digital fountain using a new class of erasure codes that are orders of magnitude faster than standard erasure codes. ...
Table 1 : 1 Properties of Tornado vs. Reed-Solomon codes
Table 2 : 2 Comparison of encoding times for erasure codes. ...
doi:10.1145/285243.285258
fatcat:n3enlvqymnbu5jynkjbirlvqve
Proofs of Retrievability via Hardness Amplification
[chapter]
2009
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 2011; you can also visit the original URL.
The file type is application/pdf.
In this work, we identify several different variants of the problem (such as bounded-use vs. unbounded-use, knowledge-soundness vs. information-soundness), and giving nearly optimal PoR schemes for each ...
Our constructions either improve (and generalize) the prior PoR constructions, or give the first known PoR schemes with the required properties. ...
Efficient erasure-decodability (statement 1) is analyzed in Section 3.2 and efficient error-decodability (statement 3) is analyzed in Section 3.3. ...
doi:10.1007/978-3-642-00457-5_8
fatcat:hj6lisowkva4no3kdf4zbeg65y
Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding
[article]
2021
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 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In particular, the error probability of single parity-check product codes over binary memoryless symmetric channels under successive cancellation decoding is characterized. ...
A bridge with the analysis of product codes introduced by Elias is also established for the binary erasure channel. ...
ACKNOWLEDGEMENT The authors would like to thank the associate editor and the anonymous reviewers for their valuable comments, which improved the presentation of the work significantly. ...
arXiv:2008.06938v2
fatcat:qbdxcf7wgve5xengegpunkid4q
DeltaCast
2005
Proceedings of the 3rd international conference on Mobile systems, applications, and services - MobiSys '05
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.
To this extent, we present DeltaCast, a system that combines hierarchical hashes and erasure codes to minimise the amount of battery power and the amount of time needed to synchronise each mobile device ...
In this paper we consider the problem of efficiently updating files in such wireless broadcast channels. ...
There is a tradeoff in utilising erasure coding in terms of the decoding requirements and consequently additional power is consumed by the device in the process of decoding erasure blocks, however we maintain ...
doi:10.1145/1067170.1067181
dblp:conf/mobisys/ChesterfieldR05
fatcat:4u7ttq3pifhahgnmjsibsa6wx4
Prototype of Virtual Full Duplex via Rapid On-Off-Division Duplex
2015
IEEE Transactions on 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 particular, the bit error rate is measured and compared with the simulation results. Our results indicate that virtual full duplex is feasible on a USRPs/LabVIEW platform via RODD. ...
of interest in the presence of background noise and interference. ...
Crucial to RODD is error-control coding over a frame of many on-and off-slots, which allows successful decoding despite erasures and superposition. ...
doi:10.1109/tcomm.2015.2465958
fatcat:eialua5de5fv3kcjyucicob6da
Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric 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.
This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second ...
Also, error resilience for combination of locally repairable codes with regenerating codes is considered. ...
If s ≤ t nodes fail the test during data reconstruction, the data collector deals with sα rank erasures and (t − s)α rank errors. ...
arXiv:1312.3194v1
fatcat:bkjttlxrtvcx7msin5z4svhkne
« Previous
Showing results 1 — 15 out of 782 results