Equidistant codes in the Grassmannian
From MaRDI portal
Publication:2345600
DOI10.1016/j.dam.2015.01.024zbMath1384.94136arXiv1308.6231OpenAlexW2026526689MaRDI QIDQ2345600
Publication date: 22 May 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.6231
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60) Combinatorial structures in finite projective spaces (51E20)
Related Items (13)
Optimum distance flag codes from spreads via perfect matchings in graphs ⋮ On sets of subspaces with two intersection dimensions and a geometrical junta bound ⋮ On the sunflower bound for \(k\)-spaces, pairwise intersecting in a point ⋮ On primitive constant dimension codes and a geometrical sunflower bound ⋮ A note on equidistant subspace codes ⋮ Equidistant subspace codes ⋮ Galois geometries and coding theory ⋮ Perfect LRCs and \(k\)-optimal LRCs ⋮ LONELY RUNNERS IN FUNCTION FIELDS ⋮ Flag codes from planar spreads in network coding ⋮ Properties of sets of subspaces with constant intersection dimension ⋮ Improvement to the sunflower bound for a class of equidistant constant dimension subspace codes ⋮ Two coloring problems on matrix graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
- Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
- The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
- Johnson type bounds on constant dimension codes
- Theory of codes with maximum rank distance
- The Erdős-Ko-Rado theorem for vector spaces
- Partial t-spreads and group constructible \((s,r,\mu)\)-nets
- Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
- Partial spreads in finite projective spaces and partial designs
- Intersection theorems for systems of finite vector spaces
- Equidistant codes with distance 12
- Bounds for equidistant codes and partial projective planes
- Bilinear forms over a finite field, with applications to coding theory
- On equidistant constant weight codes
- Linearity and complements in projective space
- Osculating Spaces of Varieties and Linear Network Codes
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Error-Correcting Codes in Projective Space
- Constant-Rank Codes and Their Connection to Constant-Dimension Codes
- A General Class of Maximal Codes ror Computer Applications
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: Equidistant codes in the Grassmannian
