Linear programming bounds for codes in Grassmannian spaces

被引:34
|
作者
Bachoc, C [1 ]
机构
[1] Inst Math Bordeaux, Lab A2X, F-33405 Talence, France
关键词
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 条
  • [21] Improved Linear Programming Bounds for Antipodal Spherical Codes
    [J]. Discrete & Computational Geometry, 2002, 28 : 107 - 114
  • [22] Linear programming bounds for quantum amplitude damping codes
    Ouyang, Yingkai
    Lai, Ching-Yi
    [J]. 2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 1875 - 1879
  • [23] Linear Programming Bounds for Codes via a Covering Argument
    Navon, Michael
    Samorodnitsky, Alex
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2009, 41 (02) : 199 - 207
  • [24] Density and Bounds for Grassmannian Codes with Chordal Distance
    Pitaval, Renaud-Alexandre
    Tirkkonen, Olav
    Blostein, Steven D.
    [J]. 2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011,
  • [25] Linear Programming Bounds for Almost-Balanced Binary Codes
    Guruswami, Venkatesan
    Riazanov, Andrii
    [J]. 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 1302 - 1307
  • [26] Linear Programming Bounds for Entanglement-Assisted Quantum Codes
    Lai, Ching-Yi
    Ashikhmin, Alexei
    [J]. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017,
  • [27] Linear Programming Bounds for Robust Locally Repairable Storage Codes
    Tebbi, M. Ali
    Chan, Terence H.
    Sung, Chi Wan
    [J]. 2014 IEEE INFORMATION THEORY WORKSHOP (ITW), 2014, : 50 - 54
  • [28] Linear Programming Bounds for multi-level Unequal Protection Codes
    Saito, Tomohiko
    Matsushima, Toshiyasu
    Hirasawa, Shigeichi
    [J]. 2018 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2018, : 2917 - 2922
  • [29] A direct approach to linear programming bounds for codes and tms-nets
    Jürgen Bierbrauer
    [J]. Designs, Codes and Cryptography, 2007, 42 : 127 - 143
  • [30] New Upper Bounds for the Size of Permutation Codes via Linear Programming
    Bogaerts, Mathieu
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):