<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=22285"><dc:title>The minimum weight of the code of intersecting lines in PG(3,q)</dc:title><dc:creator>Adriaensen,	Sam	(Avtor)
	</dc:creator><dc:creator>Simoens,	Robin	(Avtor)
	</dc:creator><dc:creator>Storme,	Leo	(Avtor)
	</dc:creator><dc:subject>linear codes</dc:subject><dc:subject>finite projective spaces</dc:subject><dc:subject>Klein quadric</dc:subject><dc:description>We characterise the minimum weight codewords of the p-ary linear code of intersecting lines in PG(3,q), q = p^h, q ≥ 19, p prime, h ≥ 1. If q is even, the minimum weight equals q³ + q² + q + 1. If q is odd, the minimum weight equals q³ + 2q² + q + 1. For q even, we also characterise the codewords of second smallest weight.</dc:description><dc:publisher>Založba Univerze na Primorskem</dc:publisher><dc:date>2026</dc:date><dc:date>2025-12-21 21:51:12</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>22285</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>