Linear codes arising from the point-hyperplane geometry. I: The Segre embedding
From MaRDI portal
Cites work
- A geometric characterization of minimal codes and their asymptotic performance
- Algebraic geometric codes. Basic notions
- Automorphism groups of Grassmann codes
- Embeddings and hyperplanes of the Lie geometry \(A_{n, \{1, n\}}(\mathbb{F})\)
- Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1009714 (Why is no real title available?)
- scientific article; zbMATH DE number 848017 (Why is no real title available?)
- Hyperplane sections of Grassmannians and the number of MDS linear codes
- Hyperplanes of Segre geometries.
- Line Hermitian Grassmann codes and their parameters
- Line polar Grassmann codes of orthogonal type
- Linear codes associated to determinantal varieties
- Linear nonbinary covering codes and saturating sets in projective spaces
- Minimal linear codes arising from blocking sets
- Minimal linear codes from Hermitian varieties and quadrics
- Minimal vectors in linear codes
- Minimum distance of orthogonal line-Grassmann codes in even characteristic
- Minimum distance of symplectic Grassmann codes
- On minimal and quasi-minimal linear codes
- On the generating rank and embedding rank of the hexagonic Lie incidence geometries
- Points and lines. Characterizing the classical geometries
- Schubert varieties, linear codes and enumerative combinatorics.
- Strong blocking sets and minimal codes from expander graphs
- Three combinatorial perspectives on minimal codes
This page was built for publication: Linear codes arising from the point-hyperplane geometry. I: The Segre embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6868416)
