Enumerative encoding in the Grassmannian space
暂无分享,去创建一个
[1] D. Knuth. Subspaces, subsets, and partitions , 1971 .
[2] N. J. A. Sloane,et al. Lexicographic codes: Error-correcting codes from game theory , 1986, IEEE Trans. Inf. Theory.
[3] Richard M. Wilson,et al. A course in combinatorics , 1992 .
[4] Frank R. Kschischang,et al. A Rank-Metric Approach to Error Control in Random Network Coding , 2007, IEEE Transactions on Information Theory.
[5] Shu-Tao Xia,et al. Johnson type bounds on constant dimension codes , 2007, Des. Codes Cryptogr..
[6] Natalia Silberstein,et al. Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams , 2008, IEEE Transactions on Information Theory.
[7] Maximilien Gadouleau,et al. Constant-Rank Codes and Their Connection to Constant-Dimension Codes , 2008, IEEE Transactions on Information Theory.
[8] Joachim Rosenthal,et al. Spread codes and spread decoding in network coding , 2008, 2008 IEEE International Symposium on Information Theory.
[9] Vitaly Skachek,et al. Recursive Code Construction for Random Networks , 2008, IEEE Transactions on Information Theory.
[10] S. Finch. Integer partitions , 2021 .
[11] Stephen C. Milne. Mappings of Subspaces into Subsets , 1982, J. Comb. Theory, Ser. A.
[12] Thomas M. Cover,et al. Enumerative source encoding , 1973, IEEE Trans. Inf. Theory.
[13] Rudolf Ahlswede,et al. On Perfect Codes and Related Concepts , 2001, Des. Codes Cryptogr..
[14] Alexander Vardy,et al. Error-correcting codes in projective space , 2008, 2008 IEEE International Symposium on Information Theory.
[15] Moshe Schwartz,et al. Codes and Anticodes in the Grassman Graph , 2002, J. Comb. Theory, Ser. A.
[16] Frank R. Kschischang,et al. Coding for Errors and Erasures in Random Network Coding , 2007, IEEE Transactions on Information Theory.
[17] Sascha Kurz,et al. Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance , 2008, MMICS.