Create New Blocking Set (97,2) On Projective Plane (2,17)

Authors

  • Mustafa Nadhim Salim Qaba Division of Basic Science, College of Agriculture and Forestry, University of Mosul, Mosul, Iraq

DOI:

https://doi.org/10.32792/jeps.v15i4.722

Abstract

The intersection points of the lines of the projective plane PG(2,17) were used to create new blocking set (97,2) In this research Four lines of the plane PG(2,17) were used, including four common points, and the points were then substituted in the equation of the straight line to form the blocking set (97,2) A projective plane PG(2,q) which consists of q2 + q + 1 points and q2 + q + 1 lines every line contains 1 + q points and every point is on 1 + q lines One point of the form (1,0,0) exists There are q points with the form (x,1,0) that exist and Similar to the lines and there exist q2 points of the type (x,y,1) A point p(x1,x2,x3) is incident with the line L[a1,a2,a3] if and only if a1x1 + a2x2 + a3x3 = 0 and The general equation of the conic

References

N. Alon, A. Bishnoi, S. Das, and A. Neri. Strong blocking sets and minimal codes from expander graphs. arXiv preprint arXiv:2305.15297, 2023. https://doi.org/10.48550/arXiv.2305.15297

D. Bartoli and M. Borello. Small strong blocking sets by concatenation. SIAM J. Discrete Math., 37(1):65–82, 2023. https://doi.org/10.1137/21M145032X

A. Bishnoi, J. D’haeseleer, D. Gijswijt, and A. Potukuchi. Blocking sets, minimal codes and trifferent codes. arXiv preprint arXiv:2301.09457, 2023. https://doi.org/10.1112/jlms.12938

G. N. Alfarano, M. Borello, A. Neri, and A. Ravagnani. Three combinatorial perspectives on minimal codes. SIAM J. Discrete Math., 36(1):461–489, 2022. https://doi.org/10.1137/21M1391493

G. N. Alfarano, M. Borello, and A. Neri. A geometric characterization of minimal codes and their asymptotic performance. Adv. in Math. Commun., 16(1):115–133, 2022. Doi: 10.3934/amc.2020104

D. Bartoli, A. Cossidente, G. Marino, and F. Pavese. On cutting blocking sets and their codes. Forum Math., 34(2):347–368, 2022. https://doi.org/10.1515/forum-2020-0338

D. Bartoli, M. Bonini, and B. G¨une¸s. An inductive construction of minimal codes. Cryptogr. Commun., 13(3):439– 449, 2021. https://doi.org/10.1007/s12095-021-00474-2

D. Bartoli, G. Kiss, S. Marcugini, and F. Pambianco. Resolving sets for higher dimensional projective spaces. Finite Fields their Appl., 67:101723, 2020. https://doi.org/10.1016/j.ffa.2020.101723

Downloads

Published

2025-12-01

Issue

Vol. 15 No. 4 (2025): JOURNAL OF EDUCATION FOR PURE SCIENCE

Section

Articles

License

Copyright (c) 2025 Journal of Education for Pure Science

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Copyright Policy

Authors retain copyright of their articles published in the Journal of Education for Pure Science (JEPS).

By submitting their work, authors grant the journal a non-exclusive license to publish, distribute, and archive the article in all formats and media.

License

All articles published in JEPS are licensed under the Creative Commons Attribution 4.0 International License (CC BY 4.0).

This license permits unrestricted use, distribution, and reproduction in any medium, provided that the original author(s) and the source are properly credited.

Author Rights

Authors have the right to:

  • Share their articles on personal websites, institutional repositories, and academic platforms

  • Reuse their work in future research and publications

  • Distribute the published version without restriction

Journal Rights

The journal retains the right to:

  • Publish and archive the articles

  • Include them in indexing and archiving systems such as LOCKSS and CLOCKSS

  • Promote and disseminate the published work

Responsibility

The contents of all articles are the sole responsibility of the authors. The journal, editors, and editorial board are not responsible for any errors, opinions, or statements expressed in the published articles.

Open Access Statement

JEPS provides immediate open access to its content, supporting the principle that making research freely available to the public enhances global knowledge exchange.

This work is licensed under a Creative Commons Attribution 4.0 International License.
https://creativecommons.org/licenses/by/4.0/