DESIGNS CODES AND CRYPTOGRAPHY, cilt.93, sa.10, ss.4141-4171, 2025 (SCI-Expanded, Scopus)
We comprehensively study weighted projective Reed-Muller (WPRM) codes on weighted projective planes P(1,a,b)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathbb {P}}}(1,a,b)$$\end{document}. We provide the universal Gr & ouml;bner basis for the vanishing ideal of the set Y of Fq\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {F}}_q$$\end{document}-rational points of P(1,a,b)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathbb {P}}}(1,a,b)$$\end{document} to get the dimension of the code. We determine the regularity set of Y using a novel combinatorial approach. We employ footprint techniques to compute the minimum distance.