id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
iajs-198	Al-Mukhtar, Amal Shihab; Thumai, Hani Sabbar	The Construction of Minimal (b,t)-Blocking Sets Containing Conics in PG(2,5) with the Complete Arcs and Projective Codes Related with Them	2017	8	.pdf	application/pdf	3510	178	83	then every point P in B there is a t-secant of B containing P. Proof: Suppose B is minimal blocking set, let P be any point in B. Let K be the complement of B, then K is complete (k,n)-arc in PG(2,q) and P is not K., then P is an (n-secant) of K, but q + 1 = t + n and so t = q + 1 – n. Definition (1.1): [1] A (k,n)–arc is a set of k points of a projective plane such that some n but no n + 1 of them are collinear, n  2. Definition (1.2): [2] A (k,n)–arc is complete if it is not contained in a (k + 1,n)-arc.	cache/iajs-198.pdf	txt/iajs-198.txt