Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings

Trees (05C05) Hypergraphs (05C65) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Cites Work

Some remarks on multiplicity codes
On the Size of Separating Systems and Families of Perfect Hash Functions
On the Problem of Decomposing a Graph into n Connected Factors
Polynomial Codes Over Certain Finite Fields
Edge-Disjoint Spanning Trees of Finite Graphs
Fredman–Komlós bounds and information theory
Perfect Hashing and Probability
On decomposing a hypergraph into \(k\) connected sub-hypergraphs
Maximum distance<tex>q</tex>-nary codes
Title not available (Why is that?)
Improved decoding of Reed-Solomon and algebraic-geometry codes
Perfect hash families: Probabilistic methods and explicit constructions
Pseudorandom generators without the XOR lemma
Extremal combinatorics. With applications in computer science
On the List and Bounded Distance Decodability of Reed–Solomon Codes
Optimal linear perfect hash families
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
Title not available (Why is that?)
Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
New bounds for perfect hashing via information theory
Title not available (Why is that?)
Title not available (Why is that?)
Separating Hash Families: A Johnson-type bound and New Constructions
Every list-decodable code for high noise has abundant near-optimal rate puncturings
Balanced hashing, color coding and approximate counting
Limits to List Decoding Reed–Solomon Codes
List-Decodability With Large Radius for Reed-Solomon Codes
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
Degenerate Turán densities of sparse hypergraphs
Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
Disjoint bases in a polymatroid
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
Title not available (Why is that?)
Balanced Families of Perfect Hash Functions and Their Applications
Packing element-disjoint steiner trees
Optimum Linear Codes With Support-Constrained Generator Matrices Over Small Fields
Title not available (Why is that?)
Beating the probabilistic lower bound on \(q\)-perfect hashing

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)