Equidistant codes in the Grassmannian

DOI10.1016/J.DAM.2015.01.024zbMATH Open1384.94136arXiv1308.6231OpenAlexW2026526689MaRDI QIDQ2345600FDOQ2345600

Authors: Tuvi Etzion, Netanel Raviv 

Publication date: 22 May 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: Equidistant codes over vector spaces are considered. For $k$-dimensional subspaces over a large vector space the largest code is always a sunflower. We present several simple constructions for such codes which might produce the largest non-sunflower codes. A novel construction, based on the Pl"{u}cker embedding, for 1-intersecting codes of $k$-dimensional subspaces over $F_q^n$, $$, where the code size is $frac{q}^{k+1}-1q-1$ is presented. Finally, we present a related construction which generates equidistant constant rank codes with matrices of size $$ over $F_q$, rank $n-1$, and rank distance $n-1$.

Full work available at URL: https://arxiv.org/abs/1308.6231

Recommendations

• Equidistant subspace codes
• A note on equidistant subspace codes
• Equidistant rank metric codes: construction and properties
• Improvement to the sunflower bound for a class of equidistant constant dimension subspace codes
• scientific article; zbMATH DE number 5790068

zbMATH Keywords

Grassmannianequidistant codessunflowerconstant rank codesPlücker embedding

Mathematics Subject Classification ID

Combinatorial structures in finite projective spaces (51E20) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60)

Cites Work

• Intersection theorems for systems of finite vector spaces
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Title not available (Why is that?)
• Bilinear forms over a finite field, with applications to coding theory
• Title not available (Why is that?)
• Johnson type bounds on constant dimension codes
• Theory of codes with maximum rank distance
• 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 Space
• Constant-Rank Codes and Their Connection to Constant-Dimension Codes
• Maximum-rank array codes and their application to crisscross error correction
• A General Class of Maximal Codes ror Computer Applications
• Partial t-spreads and group constructible \((s,r,\mu)\)-nets
• Partial spreads in finite projective spaces and partial designs
• Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
• 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)\)
• Osculating Spaces of Varieties and Linear Network Codes
• The Erdős-Ko-Rado theorem for vector spaces
• On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
• On equidistant constant weight codes
• Title not available (Why is that?)
• Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
• Bounds for equidistant codes and partial projective planes
• Equidistant codes with distance 12
• Linearity and complements in projective space

Cited In (19)

• Optimum distance flag codes from spreads via perfect matchings in graphs
• Equidistant subspace codes
• Two coloring problems on matrix graphs
• Grassmannian codes from paired difference sets
• Good equidistant codes constructed from certain combinatorial designs
• Perfect LRCs and \(k\)-optimal LRCs
• A new construction of anticode-optimal Grassmannian codes
• Flag codes from planar spreads in network coding
• LONELY RUNNERS IN FUNCTION FIELDS
• Properties of sets of subspaces with constant intersection dimension
• Equidistant rank metric codes: construction and properties
• Improvement to the sunflower bound for a class of equidistant constant dimension subspace codes
• A note on equidistant subspace codes
• Title not available (Why is that?)
• 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
• Galois geometries and coding theory
• The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds
• On primitive constant dimension codes and a geometrical sunflower bound

This page was built for publication: Equidistant codes in the Grassmannian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345600)