- Full text PDF available (8)
- This year (0)
- Last 5 years (5)
- Last 10 years (10)
Journals and Conferences
In , the codewords of small weight in the dual code of the code of points and lines of Q(4, q) are characterised. Inspired by this result, using geometrical arguments, we characterise the codewords of small weight in the dual code of the code of points and generators ofQ(5, q) andH(5, q), and we present lower bounds on the weight of the codewords in the… (More)
We show that there are graphs with n vertices containing no K5,5 which have about 12n 7/4 edges, thus proving that ex(n,K5,5) ≥ 12 (1 + o(1))n . This bound gives an asymptotic improvement to the known lower bounds on ex(n,Kt,s) for t = 5 when 5 ≤ s ≤ 12, and t = 6 when 6 ≤ s ≤ 8.
We consider Erdős-Ko-Rado sets of generators in classical finite polar spaces. These are sets of generators that all intersect non-trivially. We characterize the Erdős-Ko-Rado sets of generators of maximum size in all polar spaces, except for H(4n+ 1, q) with n ≥ 2.
Amongst the contributions to the theory of LDPC codes deriving from finite geometries (, , ), we present a study of the code C which has as parity-check matrix H the incidence matrix of the Hermitian curve of PG(2, q) and the q + 1-secant to it. The good performance of C with iterative decoding algorithm is showed by Johnson and Weller in .… (More)
Article history: Received 13 October 2010 Revised 19 December 2010 Accepted 24 January 2011 Available online 1 February 2011 Communicated by L. Storme MSC: 05B25 51A30 51A45
Using geometric properties of the variety Vr,t, the image under the Grassmannian map of a Desarguesian (t− 1)-spread of PG (rt− 1, q), we introduce error correcting codes related to the twisted tensor product construction, producing several families of constacyclic codes. We exactly determine the parameters of these codes and characterise the words of… (More)
In , the codewords of small weight in the dual code of the code of points and lines of Q(4, q) are characterized. Using geometrical arguments, we characterize the codewords of small weight in the dual code of the code of points and generators of Q(5, q) and H(5, q). For the dual codes of the codes of Q(5, q), q even, and Q(4, q), q even, we investigate… (More)
We show that the norm graph constructed in  with n vertices about 1 2n 2−1/t edges, which contains no copy of Kt,(t−1)!+1, does not contain a copy of Kt+1,(t−1)!−1.
The aim of this report is to analyze the clinical symptoms, ethologic factors, and prosthetic rehabilitation in a case of Combination Syndrome (CS). The treatment of CS can be conventional or surgical, with or without the bone reconstruction of maxilla. The correct prosthetic treatment helps this kind of patients to restore the physiologic occlusion plane… (More)