Improved decoding of Folded Reed-Solomon and Multiplicity Codes.

Swastik Kopparty, Noga Ron‐Zewi, Shubhangi Saraf, Mary Wootters

Type: Preprint

Publication Date: 2018-05-03

Citations: 0

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	Improved decoding of Folded Reed-Solomon and Multiplicity Codes	2018	Swastik Kopparty Noga Ron‐Zewi Shubhangi Saraf Mary Wootters
+ PDF Chat	Improved Decoding of Folded Reed-Solomon and Multiplicity Codes	2018	Swastik Kopparty Noga Ron‐Zewi Shubhangi Saraf Mary Wootters
+	Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes	2023	Itzhak Tamo
+ PDF Chat	Tighter list-size bounds for list-decoding and recovery of folded Reed-Solomon and multiplicity codes	2024	Itzhak Tamo
+	Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes	2023	Rohan Goyal Prahladh Harsha Mrinal Kumar Ashutosh Shankar
+	Beyond the Guruswami-Sudan (and Parvaresh-Vardy) Radii: Folded Reed-Solomon, Multiplicity and Derivative Codes	2020	Neophytos Charalambides
+	Randomly Punctured Reed–Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields	2024	Omar Alrabiah Venkatesan Guruswami Ray Li
+ PDF Chat	Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size	2024	Noga Ron‐Zewi S. Venkitesh Mary Wootters
+	Randomly punctured Reed--Solomon codes achieve list-decoding capacity over linear-sized fields	2023	Omar Alrabiah Venkatesan Guruswami Ray Li
+ PDF Chat	Improved List Size for Folded Reed-Solomon Codes	2024	Shashank Srivastava
+ PDF Chat	Ideal-Theoretic Explanation of Capacity-Achieving Decoding	2023	Siddharth Bhandari Prahladh Harsha Mrinal Kumar Madhu Sudan
+	Efficient Decoding of Folded Linearized Reed-Solomon Codes in the Sum-Rank Metric	2021	Felicitas Hörmann Hannes Bartz
+	Efficient Decoding of Folded Linearized Reed-Solomon Codes in the Sum-Rank Metric	2021	Felicitas Hörmann Hannes Bartz
+ PDF Chat	Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity	2024	A. L. Berman Yaron Shany Itzhak Tamo
+	Local List Recovery of High-rate Tensor Codes and Applications	2017	Brett Hemenway Noga Ron‐Zewi Mary Wootters
+	Local List Recovery of High-rate Tensor Codes and Applications	2017	Brett Hemenway Noga Ron‐Zewi Mary Wootters
+	Improved Maximally Recoverable LRCs using Skew Polynomials	2020	Sivakanth Gopi Venkatesan Guruswami
+ PDF Chat	Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy	2008	Venkatesan Guruswami Atri Rudra
+ PDF Chat	Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bound	2024	Yeyuan Chen Zihan Zhang
+	Lifted Reed-Solomon Codes and Lifted Multiplicity Codes.	2021	Lukas Holzbaur Rina Polyanskaya Nikita Polyanskii Ilya Vorobyev Eitan Yaakobi

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (5)

Action	Title	Year	Authors
+	Linear-time list recovery of high-rate expander codes	2015	Brett Hemenway Mary Wootters
+	Average-radius list-recovery of random linear codes: it really ties the room together.	2017	Atri Rudra Mary Wootters
+ PDF Chat	High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity	2017	Swastik Kopparty Or Meir Noga Ron‐Zewi Shubhangi Saraf
+	Local List Recovery of High-rate Tensor Codes and Applications	2017	Brett Hemenway Noga Ron‐Zewi Mary Wootters
+	L2/L2-foreach sparse recovery with low risk	2013	Anna C. Gilbert Hung Q. Ngo Ely Porat Atri Rudra Martin J. Strauss