Lower Energy Bounds for Antipodal Spherical Codes and for Codes in Infinite Projective Spaces

被引：0

作者：

Boyvalenkov, Peter G. ^{[1
,2
]}

Hardin, Douglas P. ^{[3
]}

Saff, Edward B. ^{[3
]}

Dragnev, Peter D. ^{[4
]}

Stoyanova, Maya M. ^{[5
]}

机构：

[1] South Western Univ Bulgaria, Bulgarian Acad Sci, Inst Math & Informat, Blagoevgrad, Bulgaria

[2] South Western Univ Bulgaria, Fac Math & Nat Sci, Blagoevgrad, Bulgaria

[3] Vanderbilt Univ, Ctr Construct Approximat, Dept Math, Nashville, TN USA

[4] Indiana Purdue Univ, Dept Math Sci, Ft Wayne, IN USA

[5] Univ Sofia, Fac Math & Informat, Sofia, Bulgaria

来源：

2016 XV INTERNATIONAL SYMPOSIUM PROBLEMS OF REDUNDANCY IN INFORMATION AND CONTROL SYSTEMS (REDUNDANCY) | 2016年

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

We apply linear programming (polynomial) techniques for obtaining lower bounds for the potential energy of antipodal spherical codes. For codes attaining our bounds we prove Lloyd type theorems. We also provide general formulations of our recent universal lower bound on energy of codes in infinite projective spaces.

引用

页码：28 / 32

页数：5

共 50 条

[21] Optimal simplices and codes in projective spaces
Cohn, Henry
Kumar, Abhinav
Minton, Gregory
GEOMETRY & TOPOLOGY, 2016, 20 (03) : 1289 - 1357
[22] Semidefinite programming bounds for spherical codes
Bachoc, Christine
Vallentin, Frank
2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 1801 - +
[23] BOUNDS FOR EQUIDISTANT CODES AND PARTIAL PROJECTIVE PLANES
HALL, JI
DISCRETE MATHEMATICS, 1977, 17 (01) : 85 - 94
[24] BOUNDS FOR PROJECTIVE CODES FROM SEMIDEFINITE PROGRAMMING
Bachoc, Christine
Passuello, Alberto
Vallentin, Frank
ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2013, 7 (02) : 127 - 145
[25] Energy bounds for weighted spherical codes and designs via linear programming
Borodachov, S. V.
Boyvalenkov, P. G.
Dragnev, P. D.
Hardin, D. P.
Saff, E. B.
Stoyanova, M. M.
ANALYSIS AND MATHEMATICAL PHYSICS, 2025, 15 (01)
[26] NEW LOWER BOUNDS FOR COVERING CODES
HOU, XD
IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (04) : 895 - 899
[27] On lower bounds for the redundancy of optimal codes
de, Prisco, Roberto
de Santis, Alfredo
Designs, Codes, and Cryptography, 1998, 15 (01): : 29 - 45
[28] LOWER BOUNDS FOR AUTHENTICATION CODES WITH SPLITTING
SGARRO, A
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 473 : 283 - 293
[29] Improved lower bounds for multicovering codes
Klapper, A
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (07) : 2532 - 2534
[30] New lower bounds for covering codes
Habsieger, L
Plagne, A
DISCRETE MATHEMATICS, 2000, 222 (1-3) : 125 - 149

← 1 2 3 4 5 →