Linear closures of finite geometries (Q506949): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00022-016-0322-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2290750645 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4004114 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-orthogonal Steiner systems and projective planes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5545191 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Binary codes of strongly regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2918398 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Codes with prescribed permutation group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the codes related to the Higman-Sims graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4146667 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4139254 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4064611 / rank | |||
Normal rank |
Latest revision as of 08:36, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linear closures of finite geometries |
scientific article |
Statements
Linear closures of finite geometries (English)
0 references
2 February 2017
0 references
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.
0 references
finite geometry
0 references
incidence structure
0 references
tactical configuration
0 references
block design
0 references
linear code
0 references
Hamming weight
0 references
automorphism group
0 references
permutation group
0 references
graph
0 references
digraph
0 references
adjacency geometry
0 references