期刊论文

Liu, Hongwei

英文

DESIGNS CODES AND CRYPTOGRAPHY

0925-1022

2018

86

6

1267-1279

10.1007/s10623-017-0394-9

Acknowledgements We sincerely thank the Associate Editor and the anonymous referees for their carefully reading and helpful suggestions which led to significant improvements of the paper. The research of Bocong Chen is supported by NSFC (Grant No. 11601158) and the Fundamental Research Funds for the Central Universities (Grant No. 2017MS111). The research of Hongwei Liu was supported by NSFC (Grant No. 11171370) and self-determined research funds of CCNU from the colleges’ basic research and operation of MOE (Grant No. CCNU14F01004).

本校为通讯机构

Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional properties that can be applied efficiently in encoding and decoding algorithms. It is desirable to find cyclic constant dimension codes such that both the code sizes and the minimum distances are as large as possible. In this paper, we explore the ideas of constructing cyclic constant dimension codes proposed in...