Bounds on subspace codes based on totally isotropic subspace in symplectic spaces and extended symplectic spaces
From MaRDI portal
Publication:5193469
DOI10.1142/S1793557119500694zbMath1420.94115OpenAlexW2801290316MaRDI QIDQ5193469
Publication date: 10 September 2019
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793557119500694
Related Items (1)
Cites Work
- Singular linear space and its applications
- Anzahl theorems in finite singular symplectic, unitary and orthogonal geometries
- Geometry of classical groups over finite fields and its applications
- Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space
- Sharpening the Gilbert-Varshamov bound in the finite case
- Coding for Errors and Erasures in Random Network Coding
- Network information flow
- Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding
- Bounds on subspace codes based on totally isotropic subspaces in unitary spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounds on subspace codes based on totally isotropic subspace in symplectic spaces and extended symplectic spaces