Efficient erasure correcting codes

DOI10.1109/18.910575zbMath1019.94032OpenAlexW2115104320MaRDI QIDQ4544507

Michael Luby, Mohammad Amin Shokrollahi, Daniel A. Spielman, Michael Mitzenmacher

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.910575

zbMATH Keywords

low-density parity-check codeserasure channellarge deviation analysissparse bipartite graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Other types of codes (94B60) Decoding (94B35) Channel models (including quantum) in information and communication theory (94A40)

Related Items (29)

Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables ⋮ Hardness of peeling with stashes ⋮ Applying cube attacks to stream ciphers in realistic scenarios ⋮ Private Stream Search at Almost the Same Communication Cost as a Regular Search ⋮ Satisfiability Thresholds beyond k −XORSAT ⋮ Expander \(\ell_0\)-decoding ⋮ A fast BER evaluation method for LDGM codes ⋮ Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks ⋮ Grid minors in damaged grids ⋮ Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel ⋮ How to recover a secret with \(O(n)\) additions ⋮ Achievable complexity-performance tradeoffs in lossy compression ⋮ Exact emulation of a priority queue with a switch and delay lines ⋮ On the dynamics of the glass transition on Bethe lattices ⋮ SYMMETRIC INTERPOLATORY FRAMELETS AND THEIR ERASURE RECOVERY PROPERTIES ⋮ A Spectral Approach to Analysing Belief Propagation for 3-Colouring ⋮ Finite size scaling for the core of large random hypergraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition ⋮ Theory and applications of Raptor codes ⋮ Peeling decoding of LDPC codes with applications in compressed sensing ⋮ The set of solutions of random XORSAT formulae ⋮ Core forging and local limit theorems for the \(k\)-core of random graphs ⋮ Simple multi-party set reconciliation ⋮ Erasure correction by low-density codes ⋮ Unnamed Item ⋮ A Mechanism for Communication-Efficient Broadcast Encryption over Wireless Ad Hoc Networks ⋮ Towards optimal degree distributions for left-perfect matchings in random bipartite graphs

This page was built for publication: Efficient erasure correcting codes