共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
3.
4.
Vladimir Shchigolev 《Journal of Algebra》2009,321(5):1453-1462
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
Let V be an n-dimensional vector space over the finite field consisting of q elements and let be the Grassmann graph formed by k-dimensional subspaces of V, . Denote by the restriction of to the set of all non-degenerate linear codes. We show that for any two codes the distance in coincides with the distance in only in the case when , i.e. if n is sufficiently large then for some pairs of codes the distances in the graphs and are distinct. We describe one class of such pairs. 相似文献
20.