Combining subspace codes

DOI10.3934/AMC.2021007MaRDI QIDQ6112253zbMATH OpenOpenAlexFDO

Authors Antonio Cossidente, Sascha Kurz, Giuseppe Marino, Francesco Pavese

Publication date 7 July 2023

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

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

zbMATH Keywords

constant-dimension subspace codefinite projective geometrynetwork coding

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Linear codes and caps in Galois spaces (51E22) Combinatorial codes (94B25) Bounds on codes (94B65)

Abstract: In the context of constant--dimension subspace codes, an important problem is to determine the largest possible size $A_q(n,d;k)$ of codes whose codewords are $k$-subspaces of $mathbb{F}_q^n$ with minimum subspace distance $d$. Here in order to obtain improved constructions, we investigate several approaches to combine subspace codes. This allow us to present improvements on the lower bounds for constant--dimension subspace codes for many parameters, including $A_q(10,4;5)$, $A_q(12,4;4)$, $A_q(12,6,6)$ and $A_q(16,4;4)$.

Recommendations

• The interplay of different metrics for the construction of constant dimension codes
• New constructions of constant dimension subspace codes with large sizes
• New constant dimension subspace codes from block inserting constructions
• Parallel sub-code construction for constant-dimension codes
• New constant dimension subspace codes from parallel linkage construction and multilevel construction

Cites work

• A Rank-Metric Approach to Error Control in Random Network Coding
• Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
• Bilinear forms over a finite field, with applications to coding theory
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Codes and Designs Related to Lifted MRD Codes
• Coding for Errors and Erasures in Random Network Coding
• Constant-Rank Codes and Their Connection to Constant-Dimension Codes
• Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
• Construction of subspace codes through linkage
• Coset Construction for Subspace Codes
• Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
• Generalized Linkage Construction for Constant-Dimension Codes
• scientific article; zbMATH DE number 6813620 (Why is no real title available?)
• scientific article; zbMATH DE number 3379722 (Why is no real title available?)
• Johnson type bounds on constant dimension codes
• Linear authentication codes: bounds and constructions
• MRD codes: constructions and connections
• Near perfect coverings in graphs and hypergraphs
• New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes
• New Constructions of Subspace Codes Using Subsets of MRD Codes in Several Blocks
• New LMRD Code Bounds for Constant Dimension Codes and Improved Constructions
• New lower bounds for binary constant-dimension subspace codes
• On parallelisms in finite projective spaces
• On putative q-analogues of the Fano plane and related combinatorial structures
• On subspace codes
• On the Lengths of Divisible Codes
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• Parallel Multilevel Constructions for Constant Dimension Codes
• Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
• Subspace codes in \(\operatorname{PG}(2N-1; q)\)
• Subspaces intersecting in at most a point
• Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
• The maximum size of a partial spread in a finite projective space
• Veronese subspace codes
• Über nicht-Desarguessche Ebenen mit transitiver Translationsgruppe

Cited in

(18)

• Orbit codes from forms on vector spaces over a finite field
• Parallel sub-code construction for constant-dimension codes
• Enhancing Echelon-Ferrers construction for constant dimension code
• Improved generalized block inserting construction of constant dimension codes
• scientific article; zbMATH DE number 3876612 (Why is no real title available?)
• Subspace Codes
• 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
• Bilateral multilevel construction of constant dimension codes
• The interplay of different metrics for the construction of constant dimension codes
• New constant dimension subspace codes from improved parallel subcode construction
• Generalized bilateral multilevel construction for constant dimension codes from parallel mixed dimension construction
• Multilevel inserting constructions for constant dimension subspace codes
• New constant dimension subspace codes via generalized coset construction
• New constructions of abelian non-cyclic orbit codes based on parabolic subgroups and tensor products
• Parallel construction for constant dimension codes from mixed dimension construction
• Generalized bilateral multilevel construction for constant dimension codes

This page was built for publication: Combining subspace codes

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