...
首页> 外文期刊>Advances in mathematics of communications >NEW AND UPDATED SEMIDEFINITE PROGRAMMING BOUNDS FOR SUBSPACE CODES
【24h】

NEW AND UPDATED SEMIDEFINITE PROGRAMMING BOUNDS FOR SUBSPACE CODES

机译:用于子空间代码的新的和更新的Semidefinite编程界限

获取原文
获取原文并翻译 | 示例
           

摘要

We show that A(2) (7, 4) <= 388 and, more generally, A(q) (7, 4) <= (q(2) -q + 1)[7]+ q(4) - 2q(3) + 3q(2) - 4q + 4 by semidefinite programming for q <= 101. Furthermore, we extend results by Bachoc et al. on SDP bounds for A(2) (n, d), where d is odd and n is small, to A(q)(n, d) for small q and small
机译:None

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号