arrow
返回

New Constant Dimension Subspace Codes From Generalized Inserting Construction

delete2021-04-01
delete14
PRE
AI
Y
Yongfeng Niu
Q
Qin Yue *
D
Daitao Huang
DOI:10.1109/LCOMM.2020.3046042delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Communications Letters 封面图
IEEE Communications Letters
IF:
4.4
论文数:
1.3W
被引数:
2.2W

机构

暂无机构信息
引用论文

引用论文

Distribution of PrP<sup>Sc</sup> in Cattle with Bovine Spongiform Encephalopathy Slaughtered at Abattoirs in Japan
err2006-04-28
err0
errOAAI
errNaoko Iwata; Yuko Sato; Yoshimi Higuchi; Kyoko Nohtomi; Noriyo Nagata; Hideki Hasegawa; Minoru Tobiume; Yuko Nakamura; Ken’ichi Hagiwara; Hidefumi Furuoka; Motohiro Horiuchi; Yoshio Yamakawa; Tetsutaro Sata
err分享
err收藏
err分享
err收藏
err分享
err收藏
err分享
err收藏
没有更多内容