Automorphisms of maximal cliques of graphs of non-degenerate linear codes

arxiv（2023）

引用 0|浏览0

暂无评分

摘要

Let Γ_k(V) be the Grassmann graph whose vertex set 𝒢_k(V) is formed by all k-dimensional subspaces of an n-dimensional vector space V over the finite field F_q consisting of q elements. We discuss its subgraph Γ(n,k)_q with the vertex set 𝒞(n,k)_q consisting of all non-degenerate linear [n, k]_q codes. 1更多

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要