$ s $ -PD-sets for codes from projective planes $ \mathrm{PG}(2,2^h) $ , $ 5 \leq h\leq 9 $
Dean Crnković, Nina Mostarac, Bernardo Gabriel Rodrigues, Leo Storme · Advances in Mathematics of Communications · 2020
In this paper we construct \begin{document}$ 2 $\end{document} -PD-sets of \begin{document}$ 16 $\end{document} elements for codes from the Desarguesian projective planes \begin{document}$ \mathrm{PG}(2,q) $\end{document} , where \begin{document}$ q = 2^h $\end{document} and \begin{document}$ 5\leq h \leq 9 $\end{document} . We also construct \begin{document}$ 3 $\end{document} -PD-sets of \begin{document}$ 75 $\end{document} elements for the code from the Desarguesian projective plane \begin{document}$ \mathrm{PG}(2,q) $\end{document} , where \begin{document}$ q = 2^9 $\end{document} . These \begin{document}$ 2 $\end{document} -PD-sets and \begin{document}$ 3 $\end{document} -PD-sets can be used for partial permutation decoding of codes obtained from the Desarguesian projective planes.