Subspace Codes in PG(2N − 1, Q)
- 66 Downloads
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 contained in at most one member of C. Constant-dimension subspace codes gained recently lot of interest due to the work by Koetter and Kschischang , where they presented an application of such codes for error-correction in random network coding. Here a (2n,M,4;n) q constant-dimension subspace code is constructed, for every n ≥ 4. The size of our codes is considerably larger than all known constructions so far, whenever n > 4. When n = 4 a further improvement is provided by constructing an (8,M,4;4) q constant-dimension subspace code, with M = q12 + q2(q2 + 1)2(q2 + q + 1) + 1.
Mathematics Subject Classification (2000)51E20 05B25 94B27 94B60 94B65
Unable to display preview. Download preview PDF.
- A. Cossidente and F. Pavese: On subspace codes, Des. Codes Cryptogr. DOI 10.1007/s10623-014-0018-6.Google Scholar
- A. Cossidente, G. Marino and F. Pavese: Non-linear maximum rank distance codes, Des. Codes Cryptogr. DOI 10.1007/s10623-015-0108-0.Google Scholar
- T. Honold, M. Kiermaier and S. Kurz: Optimal binary subspace codes of length 6, constant dimension 3 and minimum distance 4, Topics in finite fields 157–176, Contemp. Math. 632, Amer. Math. Soc., Providence, RI, 2015.Google Scholar
- B. Huppert: Endliche Gruppen I, Die Grundlehren der Mathematischen Wissenschaften, Springer-Verlag, Berlin-New York, 1967.Google Scholar
- A. Khaleghi, D. Silva and F. R. Kschischang: Subspace codes, Cryptography and coding 1–21, Lecture Notes in Comput. Sci., Springer, Berlin, 2009.Google Scholar
- M. Lavrauw and G. Van de Voorde: Field reduction and linear sets in finite geometry, Topics in finite fields, 271–293, Contemp. Math., 632, Amer. Math. Soc., Providence, RI, 2015.Google Scholar
- A.-L. Trautmann and J. Rosenthal: New improvements on the echelon-Ferrers construction, in: Proc. of Int. Symp. on Math. Theory of Networks and Systems, 405–408, 2010.Google Scholar