Linear closures of finite geometries (Q506949): Difference between revisions

A finite geometry is defined as a triple consisting of two finite sets \(P\), \(B\) whose elements are called points and blocks and a relation \(I\subseteq P\times B\) called incidence relation. A linear code is defined as a triple \((V,P,C)\) where \(V\) is a finitely generated free (left) \(F\)-module over a field \(F\), \(P\) is an \(F\)-basis of \(V\) and \(C\) is a subspace of \(V.\) The paper enlightens some important relations between finite geometries and linear codes. In particular, it is explained how to get a block or co-block code starting from a finite geometry and how to derive geometries from the weight classes of a code. It is also explained how to derive finite geometries and codes from simple or directed graphs. Every section is enriched with several examples.