Constructions of Sidon spaces and cyclic subspace codes
He ZHANG1,2, Xiwang CAO1,3()
1. Department of Mathematics, Nanjing University of Aeronautics and Astronautics, Nanjing 211100, China 2. School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China 3. Key Laboratory of Mathematical Modelling and High Performance Computing of Air Vehicles (NUAA), MIIT, Nanjing 211106, China
In this paper, we firstly construct several new kinds of Sidon spaces and Sidon sets by investigating some known results. Secondly, using these Sidon spaces, we will present a construction of cyclic subspace codes with cardinality τ · $\frac{{{q^n} - 1}}{{q - 1}}$ and minimum distance 2k−2, where τ is a positive integer. We furthermore give some cyclic subspace codes with size 2τ · $\frac{{{q^n} - 1}}{{q - 1}}$ and without changing the minimum distance 2k−2.
R Ahlswede , H K Aydinian , L H Khachatrian . On perfect codes and related concepts. Des Codes Cryptogr, 2001, 22 (3): 221- 237 https://doi.org/10.1023/A:1008394205999
2
C Bachoc , O Serra , Zémor . An analogue of Vosper’s theorem for extension fields. Math. Proc. Cambridge Philos. Soc., 2017, 163 (3): 423- 452 https://doi.org/10.1017/S0305004117000044
3
E Ben-Sasson , T Etzion , A Gabizon , N Raviv . Subspace polynomial and cyclic subspace codes. IEEE Trans. Inf. Theory, 2016, 62 (3): 1157- 1165 https://doi.org/10.1109/TIT.2016.2520479
4
M Braun , T Etzion , P Ostergard , A Vardy , A Wasserman . Existence of q-analogs of Steiner systems. Forum Math. Pi., 2016, 4 (e7): 1- 14
Q Cheng , S Gao , D Wan . Constructing high order elements through subspace polynomials. In: Proceedings of 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2012, 1463- 1547
7
L Chihara . On the zeros of the Askey-Wilson polynomials, with applications to coding theory. SIAM J. Math. Anal., 1987, 18 (1): 191- 207 https://doi.org/10.1137/0518015
H Gluesing-Luerssen , K Morrison , C Troha . Cyclic orbit codes and stabilizer subfields. Adv. Math. Commun., 2015, 9 (2): 177- 197 https://doi.org/10.3934/amc.2015.9.177
12
A Kohnert , S Kurz . Construction of large constant dimension codes with a prescribed minimum distance. In: Mathematical Methods in Computer Science, vol. 5393. Lecture Notes in Computer Science, 31–42 Springer, Berlin, 2008
13
R Kötter , F R Kschischang . Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory, 2008, 54 (8): 3579- 3591 https://doi.org/10.1109/TIT.2008.926449
14
W J Martin , X J Zhu . Anticodes for the Grassman and bilinear forms graphs. Des. Codes Cryptogr., 1995, 6 (1): 73- 79 https://doi.org/10.1007/BF01390772
N Raviv , I Tamo . Cyclic subspace codes and Sidon spaces. IEEE International Symposium on Information Theory, 2017, 784- 788
17
R M Roth , N Raviv , I Tamo . Construction of Sidon spaces with Applications to Coding. IEEE Trans. Inf. Theory, 2018, 64 (6): 4412- 4422 https://doi.org/10.1109/TIT.2017.2766178
