Optimal Binary (5, 3) Projective Space Codes from Maximal Partial Spreads

Recently a construction of optimal non-constant dimension subspace codes, also termed projective space codes, has been reported in a paper of Honold-Kiermaier-Kurz. Restricted to binary codes in a 5-dimensional ambient space with minimum subspace distance 3, these optimal codes were interpreted in terms of maximal partial spreads of 2-dimensional subspaces. In a parallel development, an optimal binary (5,3) code was obtained by a minimal change strategy on a nearly optimal example of Etzion and Vardy. In this article, we report several examples of optimal binary (5,3) codes obtained by the application of this strategy combined with changes to the spread structure of existing codes. We also establish that, based on the types of constituent spreads, our examples lie outside the framework of the existing construction.

[1]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2007, IEEE Transactions on Information Theory.

[2]  Heide Gluesing-Luerssen,et al.  Construction of subspace codes through linkage , 2015, Adv. Math. Commun..

[3]  Eli Ben-Sasson,et al.  Subspace Polynomials and Cyclic Subspace Codes , 2014, IEEE Transactions on Information Theory.

[4]  Sascha Kurz,et al.  Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance , 2008, MMICS.

[5]  Frank R. Kschischang,et al.  Projective space codes for the injection metric , 2009, 2009 11th Canadian Workshop on Information Theory.

[6]  Alberto Ravagnani,et al.  Optimal Ferrers Diagram Rank-Metric Codes , 2014, IEEE Transactions on Information Theory.

[7]  Natalia Silberstein,et al.  Codes and designs related to lifted MRD codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[8]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2008, IEEE Trans. Inf. Theory.

[9]  Alexander Vardy,et al.  Error-correcting codes in projective space , 2008, 2008 IEEE International Symposium on Information Theory.

[10]  Tuvi Etzion,et al.  Problems on q-Analogs in Coding Theory , 2013, ArXiv.

[11]  Sascha Kurz,et al.  Constructions and bounds for mixed-dimension subspace codes , 2015, Adv. Math. Commun..

[12]  Ronald Shaw.  Subsets of PG(n,2) and Maximal Partial Spreads in PG(4,2) , 2000, Des. Codes Cryptogr..

[13]  Sascha Kurz,et al.  Optimal Binary Subspace Codes of Length 6 , Constant Dimension 3 and Minimum Subspace Distance 4 , 2014 .

[14]  David A. Drake,et al.  Partial t-spreads and group constructible (s,r,μ)-nets , 1979 .

[15]  Anirban Ghatak.  A bound-achieving modified Etzion-Vardy (5, 3) projective space code , 2016, 2016 Twenty Second National Conference on Communication (NCC).

[16]  Natalia Silberstein,et al.  Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks , 2014, IEEE Transactions on Information Theory.

[17]  Joachim Rosenthal,et al.  Cyclic Orbit Codes , 2011, IEEE Transactions on Information Theory.

[18]  Anirban Ghatak,et al.  Subspace Codes for Random Networks Based on Plücker Coordinates and Schubert Cells , 2013, ArXiv.

[19]  Natalia Silberstein,et al.  Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams , 2008, IEEE Transactions on Information Theory.

[20]  Frank R. Kschischang,et al.  A Rank-Metric Approach to Error Control in Random Network Coding , 2007, IEEE Transactions on Information Theory.