Codes of Desarguesian projective planes of even order, projective triads and \((q+t,t)\)-arcs of type \((0, 2, t)\) (Q650828): Difference between revisions

A binary low density parity check (LDPC) code is a linear block code defined by a sparse parity check matrix, that is a matrix that contains a lot more \(0\)s than \(1\)s. Lately, many constructions related to finite geometry have been studied because of their low complexity decoding features. In this paper, the author study binary dual codes associated with Desarguesian projective planes \(PG(2,q)\), with \(q=2^h\), and their links with \((q+t ,t)\)-arcs of type \(( 0,2,t )\). Using a correspondence between \((q+t,t)\)-arcs of type \((0,2,t)\) and projective triads in \(PG(2,q)\), \(q\) even, the author obtains an alternative proof of the classification result on projective triads. An equivalent classification was found before in [\textit{D. Senato}, ``Blocking sets of index three,'' Rend. Accad. Sci. Fis. Mat., IV. Ser., Napoli 49, 89-95 (1982; Zbl 0527.51018); in Italian] and [\textit{T. Szõnyi}, ``Combinatorial problems for Abelian groups arising from geometry,'' Period. Polytech. 19, 91--100 (1991)]. The main result of this paper is the construction of a new infinite family of \((q+t,t)\)-arcs of type \(( 0,2,t )\), with \(t= \frac{q}4\). This result relates to the following long-standing conjecture of Korchmaros and Mazzocca: ``if \(4\) divides \(t\) and \(t\) divides \(q\), then there exists a \((q+t , t)\)-arc of type \((0,2,t)\)'', see [\textit{G. Korchmaros} and \textit{F. Mazzocca}, ``On \((q+t,t)\)-arcs of type \((0,2,t)\) in a Desarguesian plane of order \(q\),'' Math. Proc. Camb. Philos. Soc. 108, No. 3, 445--459 (1990; Zbl 0716.51010)].