Linear codes arising from the point-hyperplane geometry. II: The twisted embedding
From MaRDI portal
Cites work
- A geometric characterization of minimal codes and their asymptotic performance
- Algebraic geometric codes. Basic notions
- Embeddings and hyperplanes of the Lie geometry \(A_{n, \{1, n\}}(\mathbb{F})\)
- Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
- Geometric hyperplanes of the Lie geometry \(A_{n,\{1,n\}}(\mathbb{F})\)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Hyperplanes of Segre geometries.
- Line Hermitian Grassmann codes and their parameters
- Line polar Grassmann codes of orthogonal type
- Linear codes arising from the point-hyperplane geometry. I: The Segre embedding
- Linear codes associated to determinantal varieties
- Linear nonbinary covering codes and saturating sets in projective spaces
- Minimal linear codes arising from blocking sets
- Minimal vectors in linear codes
- Minimum distance of orthogonal line-Grassmann codes in even characteristic
- Minimum distance of symplectic Grassmann codes
- Subgroups of Classical Groups Generated by Long Root Elements
- The relatively universal cover of the natural embedding of the long root geometry for the group \(\mathrm{SL}(n+1,\mathbb{K})\)
- Three combinatorial perspectives on minimal codes
This page was built for publication: Linear codes arising from the point-hyperplane geometry. II: The twisted embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7239632)
