论文信息 - Cliques in projective space and construction of Cyclic Grassmannian Codes

Cliques in projective space and construction of Cyclic Grassmannian Codes

The construction of Grassmannian codes in some projective space is of highly mathematical nature and requires strong computational power for the resulting searches. In this paper was constructed, using GAP System for Computational Discrete Algebra and Wolfram Mathematica, cliques in the projective space Pq(n) and then we use these to produce cyclic Grassmannian codes.

Ismael Gutiérrez García | Ivan Molina Naizir

[1] Ismael Gutierrez,et al. Some constructions of cyclic and quasi-cyclic subspaces codes , 2015 .

[2] Heide Gluesing-Luerssen,et al. Cyclic orbit codes and stabilizer subfields , 2015, Adv. Math. Commun..

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

[4] Alexander Vardy,et al. Error-Correcting Codes in Projective Space , 2011, IEEE Trans. Inf. Theory.

[5] Eli Ben-Sasson,et al. Subspace Polynomials and Cyclic Subspace Codes , 2016, IEEE Trans. Inf. Theory.

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

[7] Hongwei Liu,et al. Constructions of cyclic constant dimension codes , 2017, Des. Codes Cryptogr..

[8] Ismael Gutiérrez,et al. Some constructions of subspaces cyclic and quasi-cyclic codes , 2015, ArXiv.

[9] Ferruh Özbudak,et al. Cyclic subspace codes via subspace polynomials , 2017, Des. Codes Cryptogr..