Abstract
In this paper, a variant of the Reed–Muller code, termed symmetric Reed-Muller (SRM) code, is proposed. We show that the bivariate version of SRM code forms the best-known locally-correctable codes in certain parameter regimes. Then, the minimum distance of SRM codes is provided in certain cases. Finally, the multivariate version of SRM codes is introduced.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
