Construction of subspace codes through linkage
From MaRDI portal
Publication:326332
DOI10.3934/amc.2016023zbMath1348.94106arXiv1505.02186OpenAlexW2963810572MaRDI QIDQ326332
Carolyn Troha, Heide Gluesing-Luerssen
Publication date: 12 October 2016
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.02186
Related Items (26)
New constant dimension subspace codes from block inserting constructions ⋮ New constant dimension subspace codes from parallel linkage construction and multilevel construction ⋮ Constructions of rank metric codes under actions of the unitary groups ⋮ Subspace code constructions ⋮ Distance distributions of cyclic orbit codes ⋮ Constant dimension codes from multilevel construction based on matchings of complete hypergraphs ⋮ Construction of constant dimension codes via improved inserting construction ⋮ Almost affinely disjoint subspaces and covering Grassmannian codes ⋮ Optimal Ferrers diagram rank-metric codes from MRD codes ⋮ Generalized block inserting for constructing new constant dimension codes ⋮ Bilateral multilevel construction of constant dimension codes ⋮ The interplay of different metrics for the construction of constant dimension codes ⋮ Combining subspace codes ⋮ New constructions of orbit codes based on imprimitive wreath products and wreathed tensor products ⋮ Subspace packings: constructions and bounds ⋮ New constructions of constant dimension codes by improved inserting construction ⋮ Improved generalized block inserting construction of constant dimension codes ⋮ Construction of spread codes based on abelian non-cyclic orbit codes ⋮ Subspace code based on flats in affine space over finite fields ⋮ New constructions of orbit codes based on the operations of orbit codes ⋮ Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2 ⋮ Orbit codes from forms on vector spaces over a finite field ⋮ A construction of abelian non-cyclic orbit codes ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces ⋮ Parallel sub-code construction for constant-dimension codes ⋮ Enhancing Echelon-Ferrers construction for constant dimension code
Cites Work
- Algebraic structures of MRD codes
- Rank subcodes in multicomponent network coding
- An algebraic approach for decoding spread codes
- Decoding of random network codes
- The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
- Theory of codes with maximum rank distance
- Partial t-spreads and group constructible \((s,r,\mu)\)-nets
- Partitions of a vector space
- Partial spreads in finite projective spaces and partial designs
- Bilinear forms over a finite field, with applications to coding theory
- 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
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
- Codes and Designs Related to Lifted MRD Codes
- Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
- q-Analogs of Packing Designs
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Subspace Codes
- On Metrics for Error Correction in Network Coding
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Recursive Code Construction for Random Networks
- Error-Correcting Codes in Projective Space
- Cyclic Orbit Codes
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
This page was built for publication: Construction of subspace codes through linkage
