| [1] |
AHLSWEDE R, CAI N, LI S Y R, et al. Network information flow[J]. IEEE Transactions on Information Theory, 2000, 46(4): 1204-1216.
|
| [2] |
GADOULEAU M, YAN Z Y. Packing and covering properties of subspace codes for error control in random linear network coding[J]. IEEE Transactions on Information Theory, 2010, 56(5): 2097-2108.
|
| [3] |
KOETTER R, KSCHISCHANG F R. Coding for errors and erasures in random network coding[J]. IEEE Transactions on Information Theory, 2008, 54(8): 3579-3591.
|
| [4] |
XIA S T, FU F W. Johnson type bounds on constant dimension codes[J]. Designs, Codes and Cryptography, 2009, 50(2): 163-172.
|
| [5] |
WANG H X, XING C P, SAFAVI-NAINI R. Linear authentication codes: bounds and constructions[J]. IEEE Transactions on Information Theory, 2003, 49(4): 866-872.
|
| [6] |
ETZION T, VARDY A. Error-correcting codes in projective space[J]. IEEE Transactions on Information Theory, 2011, 57(2): 1165-1173.
|
| [7] |
GAO Y, WANG G. Bounds on subspace codes based on subspaces of type(m, 1) in singular linear space[J]. Journal of Applied Mathematics, 2014: 1-9.
|
| [8] |
GAO Y, WANG G. Error-correcting codes in attenuated space over finite fields[J]. Finite Fields and Their Applications, 2015, 33: 103-117.
|
| [9] |
NIU M Y, WANG G, GAO Y, et al. Subspace code based on flats in affine space over finite fields[J]. Discrete Mathematics, Algorithms and Applications, 2018, 10(6): 1850078.
|
| [10] |
POROCH M H. Bounds on subspace codes based on totally isotropic subspace in symplectic spaces and extended symplectic spaces[J]. AsianEuropean Journal of Mathematics, 2019, 12(5): 1950069.
|
| [11] |
WAN Z X. Geometry of classical groups over finite fields[M]. 2th ed. Beijing: Science Press, 2002.
|