Combining subspace codes
From MaRDI portal
Publication:6112253
DOI10.3934/amc.2021007zbMath1525.94067arXiv1911.03387OpenAlexW3139634008MaRDI QIDQ6112253
Francesco Pavese, Sascha Kurz, Giuseppe Marino, Antonio Cossidente
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
Bounds on codes (94B65) Linear codes and caps in Galois spaces (51E22) Combinatorial aspects of finite geometries (05B25) Combinatorial codes (94B25)
Related Items (9)
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 ⋮ Improved generalized block inserting construction of constant dimension codes ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Construction of subspace codes through linkage
- Veronese subspace codes
- Johnson type bounds on constant dimension codes
- Near perfect coverings in graphs and hypergraphs
- Bilinear forms over a finite field, with applications to coding theory
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- Subspace codes in \(\operatorname{PG}(2N-1; q)\)
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- On parallelisms in finite projective spaces
- 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
- Über nicht-Desarguessche Ebenen mit transitiver Translationsgruppe
- On Putative q-Analogues of the Fano Plane and Related Combinatorial Structures
- 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
- 13. MRD codes: constructions and connections
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Coset Construction for Subspace Codes
- New Lower Bounds for Binary Constant-Dimension Subspace Codes
- Linear authentication codes: bounds and constructions
- New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes
- Generalized Linkage Construction for Constant-Dimension Codes
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- On the Lengths of Divisible Codes
- New Constructions of Subspace Codes Using Subsets of MRD Codes in Several Blocks
- Parallel Multilevel Constructions for Constant Dimension Codes
- New LMRD Code Bounds for Constant Dimension Codes and Improved Constructions
- Constant-Rank Codes and Their Connection to Constant-Dimension Codes
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- On subspace codes
This page was built for publication: Combining subspace codes
