Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound

被引：31

作者：

Xiang, Can ^{[1
]}

Ding, Cunsheng ^{[2
]}

Mesnager, Sihem ^{[3
]}

机构：

[1] Guangzhou Univ, Coll Math & Informat Sci, Guangzhou 510006, Guangdong, Peoples R China

[2] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples R China

[3] Univ Paris 08, Lab Anal Geometrie & Applicat, Dept Math, Sorbonne Paris Cite & Telecom ParisTech, F-93526 St Denis, France

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2015年 / 61卷 / 12期

关键词：

Codebooks; signal sets; Levenshtein bounds; codes; bent functions; semi-bent functions; CROSS-CORRELATION; COMPLEX CODEBOOKS; BENT FUNCTIONS; SEQUENCES; WELCH; CONSTRUCTION; FAMILIES; PROOF;

D O I：

10.1109/TIT.2015.2487451

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, a generic construction of codebooks based on binary codes is introduced. With this generic construction, a few previous constructions of optimal codebooks are extended, and a new class of codebooks almost meeting the Levenshtein bound is presented. Exponentially many codebooks meeting or almost meeting the Levenshtein bound from binary codes are obtained in this paper. The codebooks constructed in this paper have alphabet size 4. As a byproduct, three bounds on the parameters of binary codes are derived.

引用

页码：6526 / 6535

页数：10

共 46 条

[1] [Anonymous], 1996, Journal of Experimental Mathematics, DOI [10.1080/10586458.1996.10504585, DOI 10.1080/10586458.1996.10504585]
[2] New classes of almost bent and almost perfect nonlinear polynomials
Budaghyan, L
Carlet, C
Pott, A
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (03) : 1141 - 1152
[3] Z(4)-Kerdock codes, orthogonal spreads, and extremal euclidean line-sets
Calderbank, AR
Cameron, PJ
Kantor, WM
Seidel, JJ
[J]. PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 1997, 75 : 436 - 480
[4] CAMERON PJ, 1973, P K NED AKAD A MATH, V76, P1
[5] Binary m-sequences with three-valued crosscorrelation:: A proof of Welch's conjecture
Canteaut, A
Charpin, P
Dobbertin, H
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (01) : 4 - 8
[6] Codes, Bent Functions and Permutations Suitable for DES-like Cryptosystems
Carlet C.
Charpin P.
Zinoviev V.
[J]. Designs, Codes and Cryptography, 1998, 15 (2) : 125 - 156
[7] Carlet C., 2010, Boolean functions for cryptography and error-correcting codes, P257, DOI 10.1017/CBO9780511780448.011
[8] Christensen O., 2003, Applied and Numerical Harmonic Analysis
[9] DELSARTE P, 1975, PHILIPS RES REP, V30, P91
[10] Ding C., 2015, CODES DIFFERENCE SET

← 1 2 3 4 5 →