Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199): Difference between revisions

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