A Construction for Constant Dimension Codes from the Known Codes

[1]  Natalia Silberstein,et al.  Enumerative Coding for Grassmannian Space , 2009, IEEE Transactions on Information Theory.

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

[3]  Philippe Delsarte,et al.  Bilinear Forms over a Finite Field, with Applications to Coding Theory , 1978, J. Comb. Theory A.

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

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

[6]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[7]  Michael Braun,et al.  Systematic Construction of q-Analogs of t−(v,k,λ)-Designs , 2005, Des. Codes Cryptogr..

[8]  Ivan Molina Naizir,et al.  Finding Cliques in Projective Space: A Method for Construction of Cyclic Grassmannian Codes , 2020, IEEE Access.

[9]  Patric R. J. Östergård,et al.  New Lower Bounds for Binary Constant-Dimension Subspace Codes , 2018, Exp. Math..

[10]  Hao Chen,et al.  New Constructions of Subspace Codes Using Subsets of MRD Codes in Several Blocks , 2019, IEEE Transactions on Information Theory.

[11]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[12]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

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

[14]  Sascha Kurz,et al.  Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound , 2017, ICMCTA.

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

[16]  Fagang Li.  Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction , 2020, IEEE Transactions on Information Theory.

[17]  Hao Chen,et al.  New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes , 2018, IEEE Transactions on Information Theory.