Linear closures of finite geometries (Q506949): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Ilaria Cardinali / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05B25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05B05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C50 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05E18 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 94B25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 94B27 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 94C15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 94C30 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6680059 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
finite geometry | |||
Property / zbMATH Keywords: finite geometry / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
incidence structure | |||
Property / zbMATH Keywords: incidence structure / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
tactical configuration | |||
Property / zbMATH Keywords: tactical configuration / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
block design | |||
Property / zbMATH Keywords: block design / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
linear code | |||
Property / zbMATH Keywords: linear code / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Hamming weight | |||
Property / zbMATH Keywords: Hamming weight / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
automorphism group | |||
Property / zbMATH Keywords: automorphism group / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
permutation group | |||
Property / zbMATH Keywords: permutation group / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph | |||
Property / zbMATH Keywords: graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
digraph | |||
Property / zbMATH Keywords: digraph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
adjacency geometry | |||
Property / zbMATH Keywords: adjacency geometry / rank | |||
Normal rank |
Revision as of 01:48, 1 July 2023
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