minimal blocking set of size (30) in PG (2,19) plane
Abstract<br /> A blocking set B in projective plane PG(2,q) is a set of points such that every line in the plane intersect B in at least one point and there exist a line intersect B in only one point, we say that B is minimal if B has no blocking subset. In this research we proved the non_exis...
Main Author: | Amani Al-Salim |
---|---|
Format: | Article |
Language: | Arabic |
Published: |
College of Education for Pure Sciences
2012-09-01
|
Series: | مجلة التربية والعلم |
Subjects: | |
Online Access: | https://edusj.mosuljournals.com/article_59202_a182e2452155134808170d8159a47b87.pdf |
Similar Items
-
Incomplete (rq-q+r- ɛ , r)-arcs and minimal {ℓ,t}-Blocking set in PG(2,q)
by: Nada Yahya, et al.
Published: (2014-07-01) -
Existence Of (47,5)- Arcs in The Projective Plane PG (2,13)
by: Shuaa Aziz
Published: (2004-05-01) -
The Lower Bounds of Eight and Fourth Blocking Sets and Existence of Minimal Blocking Sets
by: L.Yasin Nada Yassen Kasm Yahya, et al.
Published: (2007-04-01) -
The Minimal Blocking Set Of Size 22 In PG ( 2 , 13 )
by: Farah Kadoo
Published: (2010-12-01) -
A Geometric Construction of a (56,2)-Blocking Set in PG(2,19) and on Three Dimensional Linear [325,3,307]_19Griesmer Code
by: Nada Kasm Yahya, et al.
Published: (2019-12-01)