TWO CLASSES OF NEAR-OPTIMAL CODEBOOKS WITH RESPECT TO THE WELCH BOUND

被引：1

作者：

Luo, Gaojun ^{[1
]}

Cao, Xiwang ^{[1
,2
]}

机构：

[1] Nanjing Univ Aeronaut & Astronaut, Dept Math, Nanjing 210016, Peoples R China

[2] Chinese Acad Sci, Inst Informat Engn, State Key Lab Informat Secur, Beijing 100093, Peoples R China

来源：

ADVANCES IN MATHEMATICS OF COMMUNICATIONS | 2021年 / 15卷 / 02期

基金：

中国国家自然科学基金;

关键词：

Codebook; Welch bound; linear code; permutation polynomial; BINARY LINEAR CODES; COMPLEX CODEBOOKS; BENT FUNCTIONS; FINITE-FIELDS; CONSTRUCTION; 2-WEIGHT;

D O I：

10.3934/amc.2020066

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

An (N, K) codebook C is a collection of N unit norm vectors in a K-dimensional vectors space. In applications of codebooks such as CDMA, those vectors in a codebook should have a small maximum magnitude of inner products between any pair of distinct code vectors. In this paper, we propose two constructions of codebooks based on p-ary linear codes and on a hybrid character sum of a special kind of functions, respectively. With these constructions, two classes of codebooks asymptotically meeting the Welch bound are presented.

引用

页码：279 / 289

页数：11

共 50 条

[31] Near-optimal solutions for two point loads between two supports
Olmedo Rojas, Carlos
Vazquez Espi, Mariano
Cervera Bravo, Jaime
Vazquez Espi, Carlos
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2013, 48 (05) : 979 - 986
[32] A near-optimal polynomial time algorithm for learning in certain classes of stochastic games
Brafman, RI
Tennenholtz, M
ARTIFICIAL INTELLIGENCE, 2000, 121 (1-2) : 31 - 47
[33] Two constructions of asymptotically optimal codebooks
Luo, Gaojun
Cao, Xiwang
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2019, 11 (04): : 825 - 838
[34] Two families of nearly optimal codebooks
Chengju Li
Qin Yue
Yiwei Huang
Designs, Codes and Cryptography, 2015, 75 : 43 - 57
[35] Two families of nearly optimal codebooks
Li, Chengju
Yue, Qin
Huang, Yiwei
DESIGNS CODES AND CRYPTOGRAPHY, 2015, 75 (01) : 43 - 57
[36] Self-accelerated Thompson sampling with near-optimal regret upper bound
Zhu, Zhenyu
Huang, Liusheng
Xu, Hongli
NEUROCOMPUTING, 2020, 399 : 37 - 47
[37] Near-Optimal Solutions for Mold Constraints on Two Parallel Machines
Ben Hmida, Abir
Jemmali, Mahdi
STUDIES IN INFORMATICS AND CONTROL, 2022, 31 (01): : 71 - 78
[38] Near-optimal location of two landings on flat, uniform terrain
Greulich, Francis E.
CANADIAN JOURNAL OF FOREST RESEARCH-REVUE CANADIENNE DE RECHERCHE FORESTIERE, 2012, 42 (02): : 227 - 237
[39] Two constructions of asymptotically optimal codebooks
Gaojun Luo
Xiwang Cao
Cryptography and Communications, 2019, 11 : 825 - 838
[40] Universal Near-Optimal Feedbacks
S. Nobakhtian
R. J. Stern
Journal of Optimization Theory and Applications, 2000, 107 : 89 - 122

← 1 2 3 4 5 →