Coset Construction for Subspace Codes

DOI10.1109/TIT.2017.2753822MaRDI QIDQ4566591zbMATH OpenFDO

Authors Daniel Heinlein, Sascha Kurz

Publication date 27 June 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: One of the main problems of the research area of network coding is to compute good lower and upper bounds of the achievable cardinality of so-called subspace codes in $operatornamePG(n,q)$, i.e., the set of subspaces of $mathbb{F}_q^n$, for a given minimal distance. Here we generalize a construction of Etzion and Silberstein to a wide range of parameters. This construction, named coset construction, improves or attains several of the previously best-known subspace code sizes and attains the MRD bound for an infinite family of parameters.

Cited in

(22)

• Enhancing Echelon-Ferrers construction for constant dimension code
• New constant dimension subspace codes from block inserting constructions
• New constant dimension subspace codes from parallel linkage construction and multilevel construction
• Distance distributions of cyclic orbit codes
• New constructions of constant dimension codes by improved inserting construction
• Improved generalized block inserting construction of constant dimension codes
• Bounds on subspace codes based on orthogonal space over finite fields of characteristic 2
• Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
• Construction of constant dimension codes via improved inserting construction
• 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 constant dimension subspace codes from improved parallel subcode construction
• Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects
• Generalized bilateral multilevel construction for constant dimension codes from parallel mixed dimension construction
• Two methods of constructing optimum distance flag codes
• Multilevel inserting constructions for constant dimension subspace codes
• New constant dimension subspace codes via generalized coset construction
• Generalized bilateral multilevel construction for constant dimension codes
• Two new constructions of almost MFRD codes

This page was built for publication: Coset Construction for Subspace Codes

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