返回
New Constant Dimension Subspace Codes From Generalized Inserting Construction
DOI:10.1109/LCOMM.2020.3046042.png)
摘要
En 中文
A basic problem about a constant dimension subspace code is to find its maximal possible size A(q)(n, d, k). Linkage construction and inserting construction are two effective methods to improve lower bounds for constant dimension codes. This letter concentrates on parallel linkage construction by He and direct inserting construction by Lao and generalizes the previous results to obtain new lower bounds of constant dimension codes, such as Aq(12,4,6).
Keyword:
Couplings
Two dimensional displays
Measurement
Machine-to-machine communications
Generators
Tools
Technological innovation
Constant dimension codes
linkage construction
inserting construction
identifying vector
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
暂无机构信息
引用论文
没有更多内容

