LAUSR

Coset Construction for Subspace Codes

Sign Up to like & get
recommendations!
1 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