Subspace Codes in PG(2N − 1, Q)
Sign Up to like & getrecommendations! Published in 2017 at "Combinatorica"
DOI: 10.1007/s00493-016-3354-5
Abstract: An (r,M,2δ;k)q constant-dimension subspace code, δ > 1, is a collection C of (k − 1)-dimensional projective subspaces of PG(r − 1,q) such that every (k − δ)-dimensional projective subspace of PG(r − 1,q) is… read more here.
Keywords: subspace code; dimension subspace; constant dimension; subspace codes ... See more keywords
Coset Construction for Subspace Codes
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2017.2753822
Abstract: One of the main problems of the research area of network coding is to compute good lower and upper bounds of the achievable cardinality of so-called subspace codes in ${ \mathcal {P}_{q}(n)}$ , i.e., the… read more here.
Keywords: construction; coset construction; subspace codes; subspace ... See more keywords
Bounds on subspace codes based on totally isotropic subspace in symplectic spaces and extended symplectic spaces
Sign Up to like & getrecommendations! Published in 2019 at "Asian-European Journal of Mathematics"
DOI: 10.1142/s1793557119500694
Abstract: In this paper, we propose the Sphere-packing bound, Singleton bound and Gilbert–Varshamov bound on the subspace codes [Formula: see text] based on totally isotropic subspaces in symplectic space [Formula: see text] and on the subspace… read more here.
Keywords: subspace codes; symplectic spaces; based totally; subspace ... See more keywords