Incidence Matrix Based Construction of Linear Error-Correcting Codes from PG(9,q) and PG(10,q)

Section: Research Article

Abstract

Error-correcting codes over finite projective geometries are of significant value in ensuring data reliability. However, because higher-dimensional spaces are far too computationally complex to tinker with, most research has been concentrated on lower dimensions. To help bridge this gap, this paper constructs new projective linear codes directly out of the high-dimensional spaces  and . We generated the companion matrices of primitive polynomials to construct points and subspaces systematically. Then, we constructed point-hyperplane incidence matrices and processed them computationally in MATLAB to determine the basic parameters of our new codes. Through this process, we obtained two specific codes: a ternary code from  with parameters.  that can correct up to  errors, and a binary code from  with parameters  that can correct up to  errors. By applying the Sphere Packing Bound, it turned out that although these codes are non-perfect, they nevertheless possess an extremely high error-correcting capacity. Overall, we were able to assemble a workable algebraic scheme that transforms the complex structure of higher-dimensional spaces into reliable error-correcting codes, offering useful theoretical insights beyond the familiar low-dimensional models.

References

  1. J. W. P. Hirschfeld, Projective geometries over finite fields, 2nd ed. Oxford: Clarendon Press, 1998. doi: 10.1093/oso/9780198502951.001.0001.
  2. J. W. P. Hirschfeld, Coding theory: lectures. Brighton: Sussex University, 2014.
  3. R. Hill, A first course in coding theory. in Oxford applied mathematics and computing science series. Oxford: Clarendon Press, 1986.
  4. N. A. M. Al-Seraji, “The geometry of the plane of order seventeen and its application to error-correcting codes,” PhD thesis, University of Sussex, Brighton, 2010.
  5. N. A. M. Al-Seraji and Z. S. Jafar, “Applications of the projective plane in coding theory,” Journal of Southwest Jiaotong University, vol. 55, no. 1, p. 2, 2020, doi: 10.35741/issn.0258-2724.55.1.2.
  6. G. Kiss and T. Szonyi, Finite geometries, 1st ed. Boca Raton: Chapman and Hall/CRC, 2019. doi: 10.1201/9781315120072.
  7. S. H. Naji and E. B. Al-Zangana, “Special NMDS codes of dimension three over the finite field of order 27,” in AIP Conference Proceedings, AIP Publishing LLC, 2023, p. 040068. doi: 10.1063/5.0120529.
  8. A. M. Khalaf and N. Y. K. Yahya, “New Examples in Coding Theory for Construction Optimal Linear Codes Related With Weight Distribution,” in AIP Conf. Proc., American Institute of Physics Inc., 2023. doi: 10.1063/5.0170590.
  9. E. B. Al-Zangana and N. Y. K. Yahya, “Subgroups and Orbits by Companion Matrix in Three Dimensional Projective Space,” Baghdad Sci. J., vol. 19, no. 4, pp. 805–810, 2022, doi: 10.21123/bsj.2022.19.4.0805.
  10. F. N. Abdullah and N. Y. K. Yahya, “Bounds on minimum distance for linear codes over GF(q),” Ital. J. Pure Appl. Math., no. 45, pp. 894–903, 2021.
  11. N. Y. K. Yahya and E. B. Al-Zangana, “The Non-existence of [1864, 3, 1828]53 Linear Code by Combinatorial Technique,” Int. J. Math. Comput. Sci., vol. 16, no. 4, pp. 1575–1581, 2021.
  12. Y. A. F. Yahya and N. Y. K. Yahya, “Applications of the PG(5,q) in coding theory,” Iraqi Journal of Science, pp. 5002–5014, Nov. 2025, doi: 10.24996/ijs.2025.66.11.25.
  13. H. M. Ahmad and N. Y. K. Yahya, “Applications of the PG(6,2) in Coding Theory,” vol. 1, no. 10, 2025.
Download this PDF file

Statistics

How to Cite

[1]
“Incidence Matrix Based Construction of Linear Error-Correcting Codes from PG(9,q) and PG(10,q)”, JES, vol. 35, no. 3, pp. 40–49, Jul. 2026, doi: 10.33899/jes.v35i3.61424.
Copyright and Licensing

How to Cite

[1]
“Incidence Matrix Based Construction of Linear Error-Correcting Codes from PG(9,q) and PG(10,q)”, JES, vol. 35, no. 3, pp. 40–49, Jul. 2026, doi: 10.33899/jes.v35i3.61424.