Bounds on subspace codes based on totally isotropic subspaces in unitary spaces
From MaRDI portal
Publication:5298339
DOI10.1142/S1793830916500567zbMath1357.94105MaRDI QIDQ5298339
You Gao, Gang Wang, Liyum Zhao
Publication date: 14 December 2016
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Related Items (3)
Constructions of rank metric codes under actions of the unitary groups ⋮ New constructions of orbit codes based on the operations of orbit codes ⋮ Bounds on subspace codes based on totally isotropic subspace in symplectic spaces and extended symplectic spaces
Cites Work
- Unnamed Item
- Johnson type bounds on constant dimension codes
- Codes and anticodes in the Grassman graph
- Coding for Errors and Erasures in Random Network Coding
- Linear authentication codes: bounds and constructions
- Perfect byte-correcting codes
- 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 totally isotropic subspaces in unitary spaces
