Bounds on subspace codes based on subspaces of type (m, 1) in singular linear space
Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space
Summary: The sphere-packing bound, Singleton bound, Wang-Xing-Safavi-Naini bound, Johnson bound, and Gilbert-Varshamov bound on the subspace codes \((n+l,M,d,(m,1))_q\) based on subspaces of type \((m,1)\) in singular linear space \(\mathbb{F}_q^{(n+l)}\) over finite fields \(\mathbb{F}_q\) are presented. Then, we prove that codes based on subspaces of type \((m,1)\) in singular linear space attain the Wang-Xing-Safavi-Naini bound if and only if they are certain Steiner structures in \(\mathbb{F}_q^{(n+l)}\).
- Bounds on subspace codes based on orthogonal space over finite fields of characteristic 2
- Bounds on subspace codes based on totally isotropic subspaces in unitary spaces
- Bounds on subspace codes based on subspaces of type (s,0,0,0) in pseudo-symplectic spaces and singular pseudo-symplectic spaces
- Relationships of bounds for sizes of subspace codes in singular linear spaces over finite fields.
- Subspace code based on flats in affine space over finite fields
- A Random Linear Network Coding Approach to Multicast
- A Rank-Metric Approach to Error Control in Random Network Coding
- Codes and anticodes in the Grassman graph
- Coding for Errors and Erasures in Random Network Coding
- Error-Correcting Codes in Projective Space
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Johnson type bounds on constant dimension codes
- Linear authentication codes: bounds and constructions
- Network information flow
- Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding
- Perfect byte-correcting codes
- Singular linear space and its applications
- Bounds on subspace codes based on subspaces of type (s,0,0,0) in pseudo-symplectic spaces and singular pseudo-symplectic spaces
- Johnson type bounds for mixed dimension subspace codes
- Subspace code based on flats in affine space over finite fields
- Relationships of bounds for sizes of subspace codes in singular linear spaces over finite fields.
- Relationships of bounds for sizes of subspace codes in singular linear spaces over finite fields.
- Bounds on subspace codes based on totally isotropic subspace in symplectic spaces and extended symplectic spaces
- Bounds on subspace codes based on orthogonal space over finite fields of characteristic 2
- Bounds on subspace codes based on totally isotropic subspaces in unitary spaces
This page was built for publication: Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2336478)
