Equidistant subspace codes

DOI10.1016/J.LAA.2015.10.029MaRDI QIDQ898789zbMATH OpenOpenAlexFDO

Authors Elisa Gorla, Alberto Ravagnani

Publication date 18 December 2015

Published in Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

equidistant subspace codesnetwork codingspreads and partial spreadssunflowers

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Canonical forms, reductions, classification (15A21) Spreads and packing problems in finite geometry (51E23) Other types of codes (94B60)

Abstract: In this paper we study equidistant subspace codes, i.e. subspace codes with the property that each two distinct codewords have the same distance. We provide an almost complete classification of such codes under the assumption that the cardinality of the ground field is large enough. More precisely, we prove that for most values of the parameters, an equidistant code of maximum cardinality is either a sunflower or the orthogonal of a sunflower. We also study equidistant codes with extremal parameters, and establish general properties of equidistant codes that are not sunflowers. Finally, we propose a systematic construction of equidistant codes based on our previous construction of partial spread codes, and provide an efficient decoding algorithm.

Recommendations

• A note on equidistant subspace codes
• Equidistant codes in the Grassmannian
• Improvement to the sunflower bound for a class of equidistant constant dimension subspace codes
• scientific article; zbMATH DE number 3983071
• Equidistant families of sets

Cites work

• A Random Linear Network Coding Approach to Multicast
• An algebraic approach for decoding spread codes
• Coding for Errors and Erasures in Random Network Coding
• Equidistant codes in the Grassmannian
• Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
• Linear network coding
• Network information flow
• On sets of planes in projective spaces intersecting mutually in one point
• On t-covers in finite projective spaces
• Partial spreads in finite projective spaces and partial designs
• Partial spreads in random network coding
• Partial t-spreads and group constructible \((s,r,\mu)\)-nets
• Une propriété extremale des plans projectifs finis dans une classe de codes équidistants

Cited in

(17)

• Flag codes from planar spreads in network coding
• A stability result and a spectrum result on constant dimension codes
• Properties of sets of subspaces with constant intersection dimension
• Improvement to the sunflower bound for a class of equidistant constant dimension subspace codes
• A family of linear codes from constant dimension subspace codes
• A construction of abelian non-cyclic orbit codes
• Equidistant codes in the Grassmannian
• Multicomponent codes with maximum code distance
• Subspace Codes
• Cross Subspace Alignment Codes for Coded Distributed Batch Computation
• On the subspace distance of the subspace codes
• Four classes of wide minimal q-ary linear codes from a general method
• Quasi-optimum distance flag codes
• On equidistant single-orbit cyclic and quasi-cyclic subspace codes
• Optimum distance flag codes from spreads via perfect matchings in graphs
• Equidistant frequency permutation arrays and related constant composition codes
• A note on equidistant subspace codes

This page was built for publication: Equidistant subspace codes

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