Linear programming bounds for codes in infinite projective spaces

被引：0
|
作者：
Boyvalenkov P. [1 ]
Danev D. [2 ]
Mitradjieva M. [1 ]
机构：
[1] Institute of Mathematics, Bulgarian Academy of Sciences, Sofia 1113
[2] Dept. of Electrical Engineering, Linköping University
来源：
Journal of Geometry | 1999年 / 66卷 / 1-2期
关键词：
Minimum Distance; Projective Space; Universal Bound; Linear Programming Bound; Programming Bound;
D O I：
10.1007/BF01225671
中图分类号：
学科分类号：
摘要：
We develop a technique for improving the universal linear programming bounds on the cardinality and the minimum distance of codes in projective spaces FPn-1. We firstly investigate test functions Pj(m, n, s) having the property that Pj(m, n, s) < 0 for some j if and only if the corresponding universal linear programming bound can be further improved by linear programming. Then we describe a method for improving the universal bounds. We also investigate the possibilities for attaining the first universal bounds. © Birkhäuser Verlag, 1999.
引用
收藏
页码：42 / 54
页数：12
相关论文
共 50 条
  • [1] Linear programming bounds for codes in Grassmannian spaces
    Bachoc, C
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) : 2111 - 2125
  • [2] Lower Energy Bounds for Antipodal Spherical Codes and for Codes in Infinite Projective Spaces
    Boyvalenkov, Peter G.
    Hardin, Douglas P.
    Saff, Edward B.
    Dragnev, Peter D.
    Stoyanova, Maya M.
    [J]. 2016 XV INTERNATIONAL SYMPOSIUM PROBLEMS OF REDUNDANCY IN INFORMATION AND CONTROL SYSTEMS (REDUNDANCY), 2016, : 28 - 32
  • [3] BOUNDS FOR PROJECTIVE CODES FROM SEMIDEFINITE PROGRAMMING
    Bachoc, Christine
    Passuello, Alberto
    Vallentin, Frank
    [J]. ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2013, 7 (02) : 127 - 145
  • [4] Linear codes from projective spaces
    Lavrauw, Michel
    Storme, Leo
    Van de Voorde, Geertrui
    [J]. ERROR-CORRECTING CODES, FINITE GEOMETRIES AND CRYPTOGRAPHY, 2010, 523 : 185 - 202
  • [5] Linear Programming Bounds for Storage Codes
    Chan, Terence H.
    Tebbi, Mohammad Ali
    Sung, Chi Wan
    [J]. 2013 9TH INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATIONS AND SIGNAL PROCESSING (ICICS), 2013,
  • [6] LINEAR PROGRAMMING BOUNDS FOR UNITARY CODES
    Creignou, Jean
    Diet, Herve
    [J]. ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2010, 4 (03) : 323 - 344
  • [7] BOUNDS FOR UNRESTRICTED CODES, BY LINEAR PROGRAMMING
    DELSARTE, P
    [J]. PHILIPS RESEARCH REPORTS, 1972, 27 (03): : 272 - +
  • [8] On the Bounds of Certain Maximal Linear Codes in a Projective Space
    Pai, Srikanth B.
    Rajan, B. Sundar
    [J]. 2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 591 - 595
  • [9] On the Bounds of Certain Maximal Linear Codes in a Projective Space
    Pai, B. Srikanth
    Rajan, B. Sundar
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (09) : 4923 - 4927
  • [10] Spectral approach to linear programming bounds on codes
    A. M. Barg
    D. Yu. Nogin
    [J]. Problems of Information Transmission, 2006, 42 : 77 - 89
12345