Equidistant codes in the Grassmannian

DOI10.1016/J.DAM.2015.01.024MaRDI QIDQ2345600zbMATH OpenOpenAlexFDO

Authors Tuvi Etzion, Netanel Raviv

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

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)

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$.

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

Cites work

• scientific article; zbMATH DE number 53569 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1116502 (Why is no real title available?)
• A General Class of Maximal Codes ror Computer Applications
• A Rank-Metric Approach to Error Control in Random Network Coding
• Bilinear forms over a finite field, with applications to coding theory
• Bounds for equidistant codes and partial projective planes
• Coding for Errors and Erasures in Random Network Coding
• Constant-Rank Codes and Their Connection to Constant-Dimension Codes
• Equidistant codes with distance 12
• Error-Correcting Codes in Projective Space
• Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
• Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems for systems of finite vector spaces
• Johnson type bounds on constant dimension codes
• Linearity and complements in projective space
• Maximum-rank array codes and their application to crisscross error correction
• On equidistant constant weight codes
• On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
• Osculating Spaces of Varieties and Linear Network Codes
• Partial spreads in finite projective spaces and partial designs
• Partial t-spreads and group constructible \((s,r,\mu)\)-nets
• The Erdős-Ko-Rado theorem for vector spaces
• The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
• Theory of codes with maximum rank distance
• Une propriété extremale des plans projectifs finis dans une classe de codes équidistants

Cited in

(19)

• Optimum distance flag codes from spreads via perfect matchings in graphs
• Equidistant subspace codes
• Two coloring problems on matrix graphs
• Good equidistant codes constructed from certain combinatorial designs
• Grassmannian codes from paired difference sets
• 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
• 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
• scientific article; zbMATH DE number 3463505 (Why is no real title available?)
• Galois geometries and coding theory
• On primitive constant dimension codes and a geometrical sunflower bound
• The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds

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)