Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
From MaRDI portal
Publication:2977381
DOI10.1109/TIT.2015.2435743zbMath1359.94834arXiv1404.6723MaRDI QIDQ2977381
Natalia Silberstein, Anna-Lena Trautmann
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.6723
Related Items (24)
New constant dimension subspace codes from block inserting constructions ⋮ Constructions of rank metric codes under actions of the unitary groups ⋮ Subspace code constructions ⋮ Construction of subspace codes through linkage ⋮ Distance distributions of cyclic orbit codes ⋮ Constant dimension codes from multilevel construction based on matchings of complete hypergraphs ⋮ 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 ⋮ Message encoding and retrieval for spread and cyclic orbit codes ⋮ New constructions of constant dimension codes by improved inserting construction ⋮ Improved generalized block inserting construction of constant dimension codes ⋮ Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank ⋮ Subspace code based on flats in affine space over finite fields ⋮ Constructions of optimal Ferrers diagram rank metric codes ⋮ Several classes of optimal Ferrers diagram rank-metric codes ⋮ New constructions of orbit codes based on the operations of orbit codes ⋮ Orbit codes from forms on vector spaces over a finite field ⋮ A construction of abelian non-cyclic orbit codes ⋮ Parallel sub-code construction for constant-dimension codes ⋮ Enhancing Echelon-Ferrers construction for constant dimension code ⋮ Subspace codes from Ferrers diagrams
This page was built for publication: Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks