On the Error-Correcting Radius of Folded Reed–Solomon Code Designs (Q3460451): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-17296-5_7
+Normal rank
@@ Property / OpenAlex ID @@
+W2294721679
@@ Property / OpenAlex ID: W2294721679 / rank @@
+Normal rank
@@ Property / cites work @@
+Highly resilient correctors for polynomials
@@ Property / cites work: Highly resilient correctors for polynomials / 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 @@
+Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
+Normal rank
@@ Property / cites work @@
+Upper Bounds on the Number of Errors Corrected by a Convolutional Code
+Normal rank
@@ Property / cites work @@
+Decoding of Reed Solomon codes beyond the error-correction bound
+Normal rank
@@ Property / cites work @@
+Pseudorandomness
@@ Property / cites work: Pseudorandomness / rank @@
+Normal rank