Construction of subspace codes through linkage
From MaRDI portal
Publication:326332
DOI10.3934/AMC.2016023zbMATH Open1348.94106arXiv1505.02186OpenAlexW2963810572MaRDI QIDQ326332FDOQ326332
Carolyn Troha, Heide Gluesing-Luerssen
Publication date: 12 October 2016
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Abstract: A construction is presented that allows to produce subspace codes of long length using subspace codes of shorter length in combination with a rank metric code. The subspace distance of the resulting code, called linkage code, is as good as the minimum subspace distance of the constituent codes. As a special application, the construction of the best known partial spreads is reproduced. Finally, for a special case of linkage, a decoding algorithm is presented which amounts to decoding with respect to the smaller constituent codes and which can be parallelized.
Full work available at URL: https://arxiv.org/abs/1505.02186
Recommendations
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Subspace Codes
- New constant dimension subspace codes from block inserting constructions
- Parallel sub-code construction for constant-dimension codes
- Construction of optimal constant-dimension subspace codes
Cites Work
- Bilinear forms over a finite field, with applications to coding theory
- Cyclic Orbit Codes
- Theory of codes with maximum rank distance
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Subspace Codes
- Error-Correcting Codes in Projective Space
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- On Metrics for Error Correction in Network Coding
- Partial t-spreads and group constructible \((s,r,\mu)\)-nets
- Partitions of a vector space
- Partial spreads in finite projective spaces and partial designs
- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
- Algebraic codes for network coding
- Cyclic orbit codes and stabilizer subfields
- Partial spreads in random network coding
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
- Codes and Designs Related to Lifted MRD Codes
- q-Analogs of Packing Designs
- Algebraic structures of MRD codes
- Rank subcodes in multicomponent network coding
- An algebraic approach for decoding spread codes
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Recursive Code Construction for Random Networks
- Decoding of random network codes
- The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
Cited In (31)
- Parallel sub-code construction for constant-dimension codes
- Enhancing Echelon-Ferrers construction for constant dimension code
- Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces
- Optimal Ferrers diagram rank-metric codes from MRD codes
- Generalized block inserting for constructing new constant dimension codes
- New constant dimension subspace codes from multilevel linkage construction
- New constant dimension subspace codes from improved parallel subcode construction
- Improved generalized block inserting construction of constant dimension codes
- New constructions of constant dimension codes by improved inserting construction
- Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
- New constant dimension subspace codes from block inserting constructions
- Bilateral multilevel construction of constant dimension codes
- Constructions of rank metric codes under actions of the unitary groups
- New constructions of orbit codes based on the operations of orbit codes
- Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction
- New constructions of orbit codes based on imprimitive wreath products and wreathed tensor products
- Combining subspace codes
- Locality and Availability of Array Codes Constructed From Subspaces
- Distance distributions of cyclic orbit codes
- The interplay of different metrics for the construction of constant dimension codes
- Almost affinely disjoint subspaces and covering Grassmannian codes
- A construction of abelian non-cyclic orbit codes
- Subspace code based on flats in affine space over finite fields
- Orbit codes from forms on vector spaces over a finite field
- Construction of constant dimension codes via improved inserting construction
- Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Subspace packings: constructions and bounds
- Construction of spread codes based on abelian non-cyclic orbit codes
- An asymptotically optimal construction of almost affinely disjoint subspaces
- Subspace code constructions
This page was built for publication: Construction of subspace codes through linkage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326332)
