Improvements on the Johnson bound for Reed-Solomon codes (Q1028479): Difference between revisions

@@ Property / cites work @@
+Learning Polynomials with Queries: The Highly Noisy Case
+Normal rank
@@ Property / cites work @@
+Decoding of Reed Solomon codes beyond the error-correction bound
+Normal rank
@@ Property / cites work @@
+Subspace Polynomials and Limits to List Decoding of 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 @@
+Improved decoding of Reed-Solomon and algebraic-geometry codes
+Normal rank
@@ Property / cites work @@
+Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
+Normal rank
@@ Property / cites work @@
+Explicit capacity-achieving list-decodable codes
@@ Property / cites work: Explicit capacity-achieving list-decodable codes / rank @@
+Normal rank
@@ Property / cites work @@
+List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
+Normal rank
@@ Property / cites work @@
+Q4536409
@@ Property / cites work: Q4536409 / rank @@
+Normal rank