[1]
|
Ahlswede, R., Cai, N., Li, S. and Yeung, R.W. (2000) Network Information Flow. IEEE Transactions on Information Theory, 46, 1204-1216. https://doi.org/10.1109/18.850663
|
[2]
|
Médard, M., Koetter, R., Karger, D.R., Effros, M., Shi, J. and Leong B. (2006) A Random Linear Network Coding Approach to Multicast. IEEE Transactions on Infor-mation Theory, 52, 4413-4430.
https://doi.org/10.1109/TIT.2006.881746
|
[3]
|
Kötter, R. and Kschischang, F.R. (2008) Coding for Errors and Erasures in Random Network Coding. IEEE Transactions on Information Theory, 54, 3579-3591. https://doi.org/10.1109/TIT.2008.926449
|
[4]
|
吴建荣, 谷建胜. 线性代数[M]. 北京: 高等教育出版社, 2009.
|
[5]
|
丘维声. 简明线性代数[M]. 北京: 北京大学出版社, 2002.
|
[6]
|
Delsarte, P. (1978) Bilinear Forms over a Finite Field, with Applications to Coding Theory. Journal of Combinatorial Theory A, 25, 226-241. https://doi.org/10.1016/0097-3165(78)90015-8
|
[7]
|
Gabidulin, È.M. (1985) Theory of Codes with Maximum Rank Distance. Problemy Peredachi Informatsii, 21, 3-16.
|
[8]
|
Silva, D., Kschischang, F.R. and Kötter, R. (2008) A Rank-Metric Approach to Error Control in Random Network Coding. IEEE Transactions on Information Theory, 54, 3951-3967. https://doi.org/10.1109/TIT.2008.928291
|
[9]
|
Liu, S., Chang, Y. and Feng, T. (2020) Parallel Multi-level Constructions for Constant Dimension Codes. IEEE Transactions on Information Theory, 66, 6884-6897. https://doi.org/10.1109/TIT.2020.3004315
|
[10]
|
Niu, Y., Yue, Q. and Huang, D. (2022) New Constant Dimension Subspace Codes from Parallel Linkage Construction and Multilevel Construction. Cryptography and Communications, 14, 201-214.
https://doi.org/10.1007/s12095-021-00504-z
|
[11]
|
冯克勤. 纠错码的代数理论[M]. 北京: 清华大学出版社, 2005.
|