Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
From MaRDI portal
Publication:6131199
Recommendations
- Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
- Improvements on the Johnson bound for Reed-Solomon codes
- Bounds on the List-Decoding Radius of Reed--Solomon Codes
- Every list-decodable code for high noise has abundant near-optimal rate puncturings
Cites work
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 3167429 (Why is no real title available?)
- scientific article; zbMATH DE number 1304313 (Why is no real title available?)
- scientific article; zbMATH DE number 1996248 (Why is no real title available?)
- scientific article; zbMATH DE number 6737879 (Why is no real title available?)
- scientific article; zbMATH DE number 7758332 (Why is no real title available?)
- Balanced Families of Perfect Hash Functions and Their Applications
- Balanced hashing, color coding and approximate counting
- Beating the probabilistic lower bound on \(q\)-perfect hashing
- Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
- Degenerate Turán densities of sparse hypergraphs
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
- Disjoint bases in a polymatroid
- Edge-Disjoint Spanning Trees of Finite Graphs
- Every list-decodable code for high noise has abundant near-optimal rate puncturings
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Extremal combinatorics. With applications in computer science
- Fredman–Komlós bounds and information theory
- Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Limits to List Decoding Reed–Solomon Codes
- Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
- List-Decodability With Large Radius for Reed-Solomon Codes
- List-decoding multiplicity codes
- Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy
- Maximum distance<tex>q</tex>-nary codes
- New bounds for perfect hashing via information theory
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
- On the Problem of Decomposing a Graph into n Connected Factors
- On the Size of Separating Systems and Families of Perfect Hash Functions
- Optimal linear perfect hash families
- Optimum Linear Codes With Support-Constrained Generator Matrices Over Small Fields
- Packing element-disjoint steiner trees
- Perfect Hashing and Probability
- Perfect hash families: Probabilistic methods and explicit constructions
- Polynomial Codes Over Certain Finite Fields
- Pseudorandom generators without the XOR lemma
- Separating hash families: a Johnson-type bound and new constructions
- Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
- Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
Cited in
(1)
This page was built for publication: Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131199)
