Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces
From MaRDI portal
Publication:2243293
DOI10.1016/j.amc.2021.126322zbMath1495.94163OpenAlexW3161165336MaRDI QIDQ2243293
Publication date: 11 November 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2021.126322
Linear codes (general theory) (94B05) Bounds on codes (94B65) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Johnson type bounds on constant dimension codes
- Error-correcting codes in attenuated space over finite fields
- Algebraic codes for network coding
- Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space
- A Random Linear Network Coding Approach to Multicast
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Network information flow
- Subspace code based on flats in affine space over finite fields
- Linear authentication codes: bounds and constructions
- Bounds on subspace codes based on totally isotropic subspace in symplectic spaces and extended symplectic spaces
- Error-Correcting Codes in Projective Space
- Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding
This page was built for publication: Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces