Bounds on subspace codes based on totally isotropic subspaces in unitary spaces
暂无分享,去创建一个
[1] Reihaneh Safavi-Naini,et al. Linear authentication codes: bounds and constructions , 2001, IEEE Trans. Inf. Theory.
[2] Maximilien Gadouleau,et al. Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding , 2008, IEEE Transactions on Information Theory.
[3] Moshe Schwartz,et al. Codes and Anticodes in the Grassman Graph , 2002, J. Comb. Theory, Ser. A.
[4] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[5] Gang Wang,et al. Bounds on Subspace Codes Based on Subspaces of Type (m, 1) in Singular Linear Space , 2014, J. Appl. Math..
[6] Shu-Tao Xia,et al. Johnson type bounds on constant dimension codes , 2007, Des. Codes Cryptogr..
[7] Tuvi Etzion. Perfect Byte-Correcting Codes , 1998, IEEE Trans. Inf. Theory.
[8] Frank R. Kschischang,et al. Coding for Errors and Erasures in Random Network Coding , 2008, IEEE Trans. Inf. Theory.
[9] Alexander Vardy,et al. Error-Correcting Codes in Projective Space , 2011, IEEE Trans. Inf. Theory.
[10] Gang Wang,et al. Error-correcting codes in attenuated space over finite fields , 2015, Finite Fields Their Appl..