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

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