2 papers
cs.IT2024
Random Reed-Solomon Codes are List Recoverable with Optimal List Size
Dean Doron, S. Venkitesh
We prove that Reed-Solomon (RS) codes with random evaluation points are list recoverable up to capacity with optimal output list size, for any input list size. Namely, given an inp…
math.CO2023
On higher multiplicity hyperplane and polynomial covers for symmetry preserving subsets of the hypercube
Arijit Ghosh, Chandrima Kayal, Soumi Nandi +1
Alon and Füredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of…