首页> 外文期刊>IEEE Transactions on Information Theory >New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
【24h】

New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters

机译:具有乘性的渐近最优码本的新结构

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

摘要

In practical applications, such as direct spread code division multiple access communications, space-time codes and compressed sensing, and codebooks with small inner-product correlation are required. It is extremely difficult to construct codebooks achieving the Levenshtein bound. In this paper, two new constructions of infinitely many codebooks with multiplicative characters of finite fields are presented. These constructions produce complex codebooks asymptotically achieving the Levenshtein bound and codebooks asymptotically achieving the Welch bound. The codebooks presented in this paper have new parameters.
机译:在实际应用中,例如直接扩展码分多址通信,时空码和压缩感测以及内积相关性小的码本是必需的。构建达到Levenshtein界限的密码本非常困难。在本文中,提出了两种新的具有有限域乘性的无穷大码本的构造。这些构造产生了渐近实现Levenshtein界的复杂码本,并渐近实现了Welch界的码本。本文介绍的密码本具有新的参数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号