Almost affinely disjoint subspaces and covering Grassmannian codes
From MaRDI portal
Publication:6063245
DOI10.1016/j.ffa.2023.102292MaRDI QIDQ6063245
Publication date: 7 November 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
cappartial spreadMRD codealmost affinely disjoint subspacecovering Grassmannian codeindependent configuration
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial aspects of finite geometries (05B25)
Cites Work
- Unnamed Item
- Unnamed Item
- Construction of subspace codes through linkage
- (Secure) linear network coding multicast
- Johnson type bounds on constant dimension codes
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Recursive constructions for large caps
- Almost affinely disjoint subspaces
- An asymptotically optimal construction of almost affinely disjoint subspaces
- Explicit subspace designs
- The maximum size of a partial spread in a finite projective space
- Improved upper bounds for partial spreads
- Partial spreads in random network coding
- Codes and Designs Related to Lifted MRD Codes
- Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance
- A Random Linear Network Coding Approach to Multicast
- Batch codes and their applications
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- The Geometry of Two-Weight Codes
- Network information flow
- Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding
- Linear network coding
- New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes
- Subspace designs based on algebraic function fields
- On the Gap Between Scalar and Vector Solutions of Generalized Combination Networks
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Network-Coding Solutions for Minimal Combination Networks and Their Sub-Networks
- Grassmannian Codes With New Distance Measures for Network Coding
- Subspace codes from Ferrers diagrams
- Error-Correcting Codes in Projective Space
- List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
This page was built for publication: Almost affinely disjoint subspaces and covering Grassmannian codes
