Linear programming bounds for codes in Grassmannian spaces

被引：34
|
作者：
Bachoc, C [1 ]
机构：
[1] Inst Math Bordeaux, Lab A2X, F-33405 Talence, France
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2006年 / 52卷 / 05期
关键词：
bounds; chordal distance; codes; Grassmann manifold; linear programming method; zonal functions;
D O I：
10.1109/TIT.2006.872973
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we develop the linear programming method to obtain bounds for the cardinality of Grassmannian codes endowed with the chordal distance. We obtain a bound and its asymptotic version that generalize the well-known bound for codes in the real projective space obtained by Kabatyanskiy and Levenshtein, and improve the Hamming bound for sufficiently large minimal distances.
引用
收藏
页码：2111 / 2125
页数：15
相关论文
共 50 条
  • [1] Linear programming bounds for codes in infinite projective spaces
    Boyvalenkov P.
    Danev D.
    Mitradjieva M.
    [J]. Journal of Geometry, 1999, 66 (1-2) : 42 - 54
  • [2] 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,
  • [3] LINEAR PROGRAMMING BOUNDS FOR UNITARY CODES
    Creignou, Jean
    Diet, Herve
    [J]. ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2010, 4 (03) : 323 - 344
  • [4] BOUNDS FOR UNRESTRICTED CODES, BY LINEAR PROGRAMMING
    DELSARTE, P
    [J]. PHILIPS RESEARCH REPORTS, 1972, 27 (03): : 272 - +
  • [5] Spectral approach to linear programming bounds on codes
    A. M. Barg
    D. Yu. Nogin
    [J]. Problems of Information Transmission, 2006, 42 : 77 - 89
  • [6] Spectral Approach to Linear Programming Bounds on Codes
    Barg, A.
    Nogin, D.
    [J]. PROBLEMS OF INFORMATION TRANSMISSION, 2006, 42 (02) : 77 - 89
  • [7] LINEAR PROGRAMMING BOUNDS FOR DISTRIBUTED STORAGE CODES
    Tebbi, Ali
    Chan, Terence
    Sung, Chi Wan
    [J]. ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2020, 14 (02) : 333 - 357
  • [8] Codes and designs in Grassmannian spaces
    Bachoc, C
    Bannai, E
    Coulangeon, R
    [J]. DISCRETE MATHEMATICS, 2004, 277 (1-3) : 15 - 28
  • [9] On linear programming bounds for spherical codes and designs
    Samorodnitsky, A
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2004, 31 (03) : 385 - 394
  • [10] On Linear Programming Bounds for Spherical Codes and Designs
    Alex Samorodnitsky
    [J]. Discrete & Computational Geometry, 2004, 31 : 385 - 394
12345