Abstract
In a recent article, Kim and Kopparty (2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid S1 × … × Sm. We show that their algorithm can be adapted to solve the unique decoding problem for the general family of Downset codes. Here, a downset code is specified by a family D of monomials closed under taking factors: The corresponding code is the space of evaluations of all polynomials that can be written as linear combinations of monomials from D.
- E. Abbe, A. Shpilka, and A. Wigderson. 2015. Reedâmuller codes for random erasures and errors. IEEE Trans. Inf. Theory 61, 10 (2015), 5229--5252. DOI:https://doi.org/10.1109/tit.2015.2462817Google Scholar
Digital Library
- Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. 1998. Proof verification and the hardness of approximation problems. J. ACM 45, 3 (1998), 501--555. DOI:https://doi.org/10.1145/278298.278306Google Scholar
Digital Library
- László Babai, Lance Fortnow, and Carsten Lund. 1991. Non-deterministic exponential time has two-prover interactive protocols. Comput. Complex. 1 (1991), 3--40. DOI:https://doi.org/10.1007/BF01200056Google Scholar
Cross Ref
- László Babai, Lance Fortnow, Noam Nisan, and Avi Wigderson. 1993. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Comput. Complex. 3 (1993), 307--318. DOI:https://doi.org/10.1007/BF01275486Google Scholar
Digital Library
- Elwyn R. Berlekamp and Lloyd R. Welch. 1986. Error correction for algebraic block codes. US Patent US4633470A (1986).Google Scholar
- David Cox, John Little, and Donal O’Shea. 2007. Ideals, Varieties, and Algorithms (3rd ed.). Springer, New York. DOI:https://doi.org/10.1007/978-0-387-35651-8Google Scholar
- Richard A. DeMillo and Richard J. Lipton. 1978. A probabilistic remark on algebraic program testing. Inf. Process. Lett. 7, 4 (1978), 193--195. DOI:https://doi.org/10.1016/0020-0190(78)90067-4Google Scholar
Cross Ref
- Olav Geil and Casper Thomsen. 2013. Weighted reed-muller codes revisited. Des. Codes Cryptogr. 66, 1--3 (2013), 195--220. DOI:https://doi.org/10.1007/s10623-012-9680-8Google Scholar
Digital Library
- Venkatesan Guruswami and Madhu Sudan. 1999. Improved decoding of reed-solomon and algebraic-geometry codes. IEEE Trans. Inf. Theory 45, 6 (1999), 1757--1767. DOI:https://doi.org/10.1109/18.782097Google Scholar
Digital Library
- Venkatesan Guruswami, Atri Rudra, and Madhu Sudan. 2019. Essential Coding Theory (draft). Available at https://cse.buffalo.edu/faculty/atri/courses/coding-theory/book/web-coding-book.pdf.Google Scholar
- G. David Forney Jr. 1966. Generalized minimum distance decoding. IEEE Trans. Inf. Theory 12, 2 (1966), 125--131. DOI:https://doi.org/10.1109/TIT.1966.1053873Google Scholar
Digital Library
- John Y. Kim and Swastik Kopparty. 2017. Decoding reed-muller codes over product sets. Theory Comput. 13, 21 (2017), 1--38. DOI:https://doi.org/10.4086/toc.2017.v013a021Google Scholar
Cross Ref
- Carsten Lund, Lance Fortnow, Howard J. Karloff, and Noam Nisan. 1992. Algebraic methods for interactive proof systems. J. ACM 39, 4 (1992), 859--868. DOI:https://doi.org/10.1145/146585.146605Google Scholar
Digital Library
- F. S. Macaulay. 1927. Some properties of enumeration in the theory of modular systems. Proc. Lond. Math. Soc. s2-26, 1 (1927), 531--555. DOI:https://doi.org/10.1112/plms/s2-26.1.531Google Scholar
Cross Ref
- D. E. Muller. 1954. Application of boolean algebra to switching circuit design and to error detection. Trans. I.R.E. Prof. Group Electr. Comput. EC-3, 3 (1954), 6--12. DOI:https://doi.org/10.1109/irepgelc.1954.6499441Google Scholar
- R. Pellikaan and Xin-Wen Wu. 2004. List decoding of q-ary reed-muller codes. IEEE Trans. Inf. Theory 50, 4 (2004), 679--682. DOI:https://doi.org/10.1109/tit.2004.825043Google Scholar
Digital Library
- Irving S. Reed. 1954. A class of multiple-error-correcting codes and the decoding scheme. Trans. IRE Prof. Group Inf. Theory 4, 4 (1954), 38--49. DOI:https://doi.org/10.1109/TIT.1954.1057465Google Scholar
Cross Ref
- I. S. Reed and G. Solomon. 1960. Polynomial codes over certain finite fields. J. Soc. Indust. Appl. Math. 8 (1960), 300--304. DOI:https://doi.org/10.1137/0108018Google Scholar
Cross Ref
- Jacob T. Schwartz. 1980. Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27, 4 (1980), 701--717. DOI:https://doi.org/10.1145/322217.322225Google Scholar
Digital Library
- Adi Shamir. 1992. IP = PSPACE. J. ACM 39, 4 (1992), 869--877. DOI:https://doi.org/10.1145/146585.146609Google Scholar
Digital Library
- Anders Bjært Sørensen. 1992. Weighted reed-muller codes and algebraic-geometric codes. IEEE Trans. Inform. Theory 38, 6 (1992), 1821--1826. DOI:https://doi.org/10.1109/18.165459Google Scholar
Digital Library
- Madhu Sudan. 1997. Decoding of reed-solomon codes beyond the error-correction bound. J. Complex. 13, 1 (1997), 180--193. DOI:https://doi.org/10.1006/jcom.1997.0439Google Scholar
Digital Library
- Madhu Sudan, Luca Trevisan, and Salil P. Vadhan. 2001. Pseudorandom generators without the XOR lemma. J. Comput. Syst. Sci. 62, 2 (2001), 236--266. DOI:https://doi.org/10.1006/jcss.2000.1730Google Scholar
Digital Library
- Richard Zippel. 1979. Probabilistic algorithms for sparse polynomials. In Proceedings of the Symbolic and Algebraic Computation, An International Symposiumon Symbolic and Algebraic Computation (EUROSAM’79). 216--226. DOI:https://doi.org/10.1007/3-540-09519-5_73Google Scholar
Cross Ref
Index Terms
Decoding Variants of Reed-Muller Codes over Finite Grids
Recommendations
On Perfect and Reed–Muller Codes over Finite Fields
AbstractWe consider error-correcting codes over a finite field with elements (-ary codes). We study relations between single-error-correcting -ary perfect codes and -ary Reed–Muller codes. For we find parameters of affine Reed–Muller codes of order . We ...
Joint decoding of unequally protected JPEG2000 bitstreams and reed-Solomon codes
Special section on distributed camera networks: sensing, processing, communication, and implementationIn this paper we present joint decoding of JPEG2000 bitstreams and Reed-Solomon codes in the context of unequal loss protection. Using error resilience features of JPEG2000 bitstreams, the joint decoder helps to restore the erased symbols when the Reed-...
Soft-decision decoding of Reed-Muller codes: recursive lists
Recursive list decoding is considered for Reed-Muller (RM) codes. The algorithm repeatedly relegates itself to the shorter RM codes by recalculating the posterior probabilities of their symbols. Intermediate decodings are only performed when these ...






Comments