List decoding from erasures: bounds and code constructions
From MaRDI portal
Recommendations
Cited in
(30)- Relative generalized Hamming weights of cyclic codes
- The cell probe complexity of succinct data structures
- Generalized Hamming weights of three classes of linear codes
- The weight hierarchy of a family of cyclic codes with arbitrary number of nonzeroes
- Advice lower bounds for the dense model theorem
- Higher Hamming weights for locally recoverable codes on algebraic curves
- Erasure/List Random Coding Error Exponents Are Not Universally Achievable
- On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size
- scientific article; zbMATH DE number 2081105 (Why is no real title available?)
- Erasure, list, and detection zero-error capacities for low noise and a relation to identification
- Low-density parity-check codes achieve list-decoding capacity
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
- Secret sharing with binary shares
- Erasures vs. errors in local decoding and property testing
- scientific article; zbMATH DE number 7561729 (Why is no real title available?)
- Symmetric disjunctive list-decoding codes
- ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES
- Erasures versus errors in local decoding and property testing
- Erasure list-decodable codes and Turán hypercube problems
- The weight hierarchies of linear codes from simplicial complexes
- Pauli manipulation detection codes and applications to quantum communication over adversarial channels
- An algorithm for computing generalized Hamming weights and the Sage package \texttt{GHWs}
- The weight distributions and weight hierarchies of two classes of few-weight linear codes
- On limits of symbolic approach to SAT solving
- The weight hierarchies of three classes of linear codes
- About the generalized Hamming weights of matrix-product codes
- Codes for adversaries: between worst-case and average-case jamming
- Generalized Hamming weights of almost-MDS codes with respect to twisted Reed-Solomon codes
- List-recovery of random linear codes over small fields
- Generic erasure correcting sets: bounds and constructions
This page was built for publication: List decoding from erasures: bounds and code constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546962)
