2000 character limit reached
Estimating the Weight Enumerators of Reed-Muller Codes via Sampling
Published 9 Mar 2024 in cs.IT and math.IT | (2403.05893v1)
Abstract: This paper develops an algorithmic approach for obtaining estimates of the weight enumerators of Reed-Muller (RM) codes. Our algorithm is based on a technique for estimating the partition functions of spin systems, which in turn employs a sampler that produces codewords according to a suitably defined Gibbs distribution. We apply our method to moderate-blocklength RM codes and derive approximate values of their weight enumerators. We observe that the rates of the weight enumerator estimates returned by our method are close to the true rates when these rates are either known or computable by brute-force search; in other cases, our computations provide provably robust estimates. As a byproduct, our sampling algorithm also allows us to obtain estimates of the weight spectra of RM codes. We illustrate our methods by providing estimates of the hitherto unknown weight enumerators of the RM$(11,5)$ code and the exact weight spectra of the RM$(10,3)$ and RM$(10,4)$ codes.
- J. L. Massey, “Deep-space communications and coding: A marriage made in heaven,” in Advanced Methods for Satellite and Deep Space Communications, J. Hagenauer, Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, pp. 1–17.
- G. Liva, L. Gaudio, T. Ninacs, and T. Jerkovits, “Code design for short blocks: A survey,” arXiv e-prints, p. arXiv:1610.00873, Oct. 2016.
- G. Reeves and H. D. Pfister, “Reed–Muller codes on BMS channels achieve vanishing bit-error probability for all rates below capacity,” IEEE Transactions on Information Theory, pp. 1–1, 2023.
- E. Abbe and C. Sandon, “A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels,” arXiv e-prints, p. arXiv:2304.02509, Apr. 2023.
- T. Kasami and N. Tokura, “On the weight structure of Reed-Muller codes,” IEEE Transactions on Information Theory, vol. 16, no. 6, pp. 752–759, 1970.
- T. Kasami, N. Tokura, and S. Azumi, “On the weight enumeration of weights less than 2.5d of Reed-Muller codes,” Information and Control, vol. 30, no. 4, pp. 380–395, 1976. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0019995876903557
- N. Sloane and E. Berlekamp, “Weight enumerator for second-order Reed-Muller codes,” IEEE Transactions on Information Theory, vol. 16, no. 6, pp. 745–751, 1970.
- M. Sugino, Y. Ienaga, N. Tokura, and T. Kasami, “Weight distribution of (128, 64) Reed-Muller code (corresp.),” IEEE Transactions on Information Theory, vol. 17, no. 5, pp. 627–628, 1971.
- T. Sugita, T. Kasami, and T. Fujiwara, “Weight distributions of the third and fifth order Reed-Muller codes of length 512.”
- T. Kaufman, S. Lovett, and E. Porat, “Weight distribution and list-decoding size of Reed-Muller codes,” IEEE Transactions on Information Theory, vol. 58, no. 5, pp. 2689–2696, 2012.
- A. Samorodnitsky, “An upper bound on ℓqsubscriptℓ𝑞\ell_{q}roman_ℓ start_POSTSUBSCRIPT italic_q end_POSTSUBSCRIPT norms of noisy functions,” IEEE Transactions on Information Theory, vol. 66, no. 2, pp. 742–748, 2020.
- O. Sberlo and A. Shpilka, “On the performance of Reed-Muller codes with respect to random errors and erasures,” in Proc. 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’20), Salt Lake City, Utah, USA, 2020, pp. 1357–1376.
- E. Abbe, A. Shpilka, and A. Wigderson, “Reed–Muller codes for random erasures and errors,” IEEE Transactions on Information Theory, vol. 61, no. 10, pp. 5229–5252, 2015.
- A. Rao and O. Sprumont, “On list decoding transitive codes from random errors,” 2022. [Online]. Available: https://homes.cs.washington.edu/~anuprao/pubs/rmlist.pdf
- D. Sarwate, “Weight enumeration of Reed-Muller codes and cosets,” PhD thesis, Princeton University, 1973.
- A. Gamal, L. Hemachandra, I. Shperling, and V. Wei, “Using simulated annealing to design good codes,” IEEE Transactions on Information Theory, vol. 33, no. 1, pp. 116–123, 1987.
- V. A. Rameshwar, S. Jain, and N. Kashyap, “Sampling-based estimates of the sizes of constrained subcodes of Reed-Muller codes,” in 30thth{}^{\text{th}}start_FLOATSUPERSCRIPT th end_FLOATSUPERSCRIPT National Conference on Communications (NCC), 2024.
- E. Abbe, A. Shpilka, and M. Ye, “Reed-Muller codes: Theory and algorithms,” IEEE Transactions on Information Theory, vol. 67, no. 6, pp. 3251–3277, 2021.
- J. MacWilliams, “A theorem on the distribution of weights in a systematic code,” The Bell System Technical Journal, vol. 42, no. 1, pp. 79–94, 1963.
- H. Chen, “A rendezvous of logic, complexity, and algebra,” ACM Comput. Surv., vol. 42, no. 1, dec 2009. [Online]. Available: https://doi.org/10.1145/1592451.1592453
- ——, “A rendezvous of logic, complexity, and algebra,” SIGACT News, vol. 37, no. 4, p. 85–114, dec 2006. [Online]. Available: https://doi.org/10.1145/1189056.1189076
- T. J. Schaefer, “The complexity of satisfiability problems,” in Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, ser. STOC ’78. New York, NY, USA: Association for Computing Machinery, 1978, p. 216–226. [Online]. Available: https://doi.org/10.1145/800133.804350
- N. Creignou and M. Hermann, “Complexity of generalized satisfiability counting problems,” Information and Computation, vol. 125, no. 1, pp. 1–12, 1996. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0890540196900164
- J. P. Valleau and D. N. Card, “Monte Carlo estimation of the free energy by multistage sampling,” The Journal of Chemical Physics, vol. 57, no. 12, pp. 5457–5462, 09 2003. [Online]. Available: https://doi.org/10.1063/1.1678245
- A. Sinclair, “Partition functions: Algorithms & complexity, Fall 2020,” Lecture notes. [Online]. Available: https://people.eecs.berkeley.edu/~sinclair/cs294/f20.html
- OEIS Foundation Inc. (2022). The On-Line Encyclopedia of Integer Sequences. [Online]. Available: http://oeis.org
- GitHub repository. [Online]. Available: https://github.com/shreyas7411/RM-Weights/tree/main
- C. Carlet and P. Solé, “The weight spectrum of two families of Reed-Muller codes,” Discrete Mathematics, vol. 346, no. 10, p. 113568, oct 2023. [Online]. Available: https://doi.org/10.1016%2Fj.disc.2023.113568
- M. Markov and Y. Borissov, “Computing the weight distribution of the binary Reed-Muller code ℛ(4,9)ℛ49{\mathcal{R}}(4,9)caligraphic_R ( 4 , 9 ),” arXiv e-prints, p. arXiv:2309.10462, Sep. 2023.
- M. E. Dyer and A. Frieze, “Computing the volume of a convex body: A case where randomness provably helps,” in Proceedings of AMS Symposium on Probabilistic Combinatorics and Its Applications, 1991, pp. 123–170.
- D. Stefankovic, S. Vempala, and E. Vigoda, “Adaptive simulated annealing: A near-optimal connection between sampling and counting,” in 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS’07), 2007, pp. 183–193.
- V. A. Rameshwar and N. Kashyap, “Coding schemes based on Reed-Muller codes for (d,∞)𝑑(d,\infty)( italic_d , ∞ )-RLL input-constrained channels,” IEEE Transactions on Information Theory, pp. 1–1, 2023. [Online]. Available: https://arxiv.org/abs/2211.05513
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
