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 条
  • [31] New upper bounds on codes via association schemes and linear programming
    Mounits, Beniamin
    Etzion, Tuvi
    Litsyn, Simon
    [J]. ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2007, 1 (02) : 173 - 195
  • [32] Improved Linear Programming Decoding and Bounds on the Minimum Distance of LDPC Codes
    Burshtein, David
    Goldenberg, Idan
    [J]. 2010 IEEE INFORMATION THEORY WORKSHOP (ITW), 2010,
  • [33] Linear Programming Bounds on the Kissing Number of q-ary Codes
    Sole, Patrick
    Liu, Yi
    Cheng, Wei
    Guilley, Sylvain
    Rioul, Olivier
    [J]. 2021 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,
  • [34] A direct approach to linear programming bounds for codes and tms-nets
    Bierbrauer, Juergen
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2007, 42 (02) : 127 - 143
  • [35] Bounds for codes by semidefinite programming
    Musin, O. R.
    [J]. PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2008, 263 (01) : 134 - 149
  • [36] Bounds for codes by semidefinite programming
    O. R. Musin
    [J]. Proceedings of the Steklov Institute of Mathematics, 2008, 263 : 134 - 149
  • [37] Linear programming bounds for doubly-even self-dual codes
    Krasikov, I
    Litsyn, S
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (04) : 1238 - 1244
  • [38] Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances
    Boyvalenkov, Peter
    Dragnev, Peter
    Hardin, Douglas
    Saff, Edward
    Stoyanova, Maya
    [J]. 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1747 - 1751
  • [39] ERROR BOUNDS FOR REPEAT-ACCUMULATE CODES DECODED VIA LINEAR PROGRAMMING
    Goldenberg, Idan
    Burshtein, David
    [J]. ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2011, 5 (04) : 555 - 570
  • [40] Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance
    Burshtein, David
    Goldenberg, Idan
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (11) : 7386 - 7402
12345