New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes
From MaRDI portal
Publication:4682918
DOI10.1109/TIT.2018.2839596zbMath1401.94240WikidataQ129804963 ScholiaQ129804963MaRDI QIDQ4682918
Publication date: 19 September 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (15)
New constant dimension subspace codes from block inserting constructions ⋮ New constant dimension subspace codes from parallel linkage construction and multilevel construction ⋮ 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 constant dimension codes by improved inserting construction ⋮ Improved generalized block inserting construction of constant dimension codes ⋮ Bounds on the cardinality of subspace codes with non-maximum code distance ⋮ Parallel sub-code construction for constant-dimension codes ⋮ Enhancing Echelon-Ferrers construction for constant dimension code
This page was built for publication: New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes
