Efficient erasure correcting codes
From MaRDI portal
Recommendations
Cited in
(69)- Erasure correction by low-density codes
- Expander \(\ell_0\)-decoding
- Erasure correction and locality of hypergraph codes
- Peeling decoding of LDPC codes with applications in compressed sensing
- Erasure-resilient codes from affine spaces
- Achievable complexity-performance tradeoffs in lossy compression
- Asymptotically optimal erasure-resilient codes for large disk arrays.
- Hierarchical erasure correction of linear codes
- Simple multi-party set reconciliation
- Linearized decomposition codes and finite integer set coverings
- Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition
- Erasure recovery matrices for encoder protection
- Core forging and local limit theorems for the \(k\)-core of random graphs
- Applying cube attacks to stream ciphers in realistic scenarios
- Zigzag decodable codes: linear-time erasure codes with applications to data storage
- Exact emulation of a priority queue with a switch and delay lines
- On the dynamics of the glass transition on Bethe lattices
- Recovering erasures by using MDS codes over extension alphabets
- Hardness of peeling with stashes
- A mechanism for communication-efficient broadcast encryption over wireless ad hoc networks
- Satisfiability thresholds beyond k-XORSAT
- Efficient Error-Correcting Codes for Sliding Windows
- Improving key recovery to 784 and 799 rounds of Trivium using optimized cube attacks
- Deterministic rateless codes for BSC
- Raptor codes
- scientific article; zbMATH DE number 4130303 (Why is no real title available?)
- A linear time erasure-resilient code with nearly optimal recovery
- Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables
- An MP decoder with error correction codes based on single feedback SLT codes
- Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding
- Private stream search at almost the same communication cost as a regular search
- SPC product codes over the erasure channel
- SYMMETRIC INTERPOLATORY FRAMELETS AND THEIR ERASURE RECOVERY PROPERTIES
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- Burst Erasure Correction Codes With Low Decoding Delay
- Raptor codes
- A spectral approach to analysing belief propagation for 3-colouring
- The Information Lost in Erasures
- scientific article; zbMATH DE number 4047591 (Why is no real title available?)
- Grid minors in damaged grids
- Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel
- Probabilistic crisscross error correction
- scientific article; zbMATH DE number 1504652 (Why is no real title available?)
- Linear-time binary codes correcting localized erasures
- scientific article; zbMATH DE number 1559530 (Why is no real title available?)
- scientific article; zbMATH DE number 1775410 (Why is no real title available?)
- Dynamic programming and the graphical representation of error-correcting codes
- scientific article; zbMATH DE number 2154518 (Why is no real title available?)
- Theory and applications of Raptor codes
- Good error-correcting codes based on very sparse matrices
- Scale-free Luby transform codes
- scientific article; zbMATH DE number 1456837 (Why is no real title available?)
- scientific article; zbMATH DE number 7434644 (Why is no real title available?)
- Dense peelable random uniform hypergraphs
- scientific article; zbMATH DE number 7525476 (Why is no real title available?)
- Secure Erasure Codes With Partial Reconstructibility
- A joint degree distribution LT codes design
- The set of solutions of random XORSAT formulae
- A fast BER evaluation method for LDGM codes
- How to recover a secret with O(n) additions
- Evolving secret sharing revisited: computational security and succinctness
- When can an expander code correct (n) errors in O(n) time?
- Peeling close to the orientability threshold. Spatial coupling in hashing-based data structures
- Evolving secret sharing made short
- Ribbon: fast succinct static retrieval and approximate membership
- The set of solutions of random XORSAT formulae
- Random matrices and codes for the erasure channel
- Generic erasure correcting sets: bounds and constructions
- Finite size scaling for the core of large random hypergraphs
This page was built for publication: Efficient erasure correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544507)
