On upper bounds for minimum distance and covering radius of non-binary codes

被引:0
|
作者
Laihonen, Tero
Litsyn, Simon
机构
来源
Designs, Codes, and Cryptography | 1998年 / 14卷 / 01期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:71 / 80
相关论文
共 50 条
  • [31] Bounds on the covering radius of linear codes
    Ashikhmin, A
    Barg, A
    DESIGNS CODES AND CRYPTOGRAPHY, 2002, 27 (03) : 261 - 269
  • [32] NEW MINIMUM DISTANCE BOUNDS FOR CERTAIN BINARY LINEAR CODES
    DASKALOV, RN
    KAPRALOV, SN
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (06) : 1795 - 1796
  • [33] Minimum Distance Optimization with Chord Edge Growth for High Girth Non-Binary LDPC Codes
    Han, Changcai
    Li, Hui
    Chen, Weigang
    ELECTRONICS, 2020, 9 (12) : 1 - 17
  • [34] New Bounds on the Size of Binary Codes With Large Minimum Distance
    Pang J.C.-J.
    Mahdavifar H.
    Sandeep Pradhan S.
    IEEE Journal on Selected Areas in Information Theory, 2023, 4 : 219 - 231
  • [35] A new upper bound on the rate of non-binary codes
    Ben-Haim, Yael
    Litsyn, Simon
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2007, 1 (01) : 83 - 92
  • [36] A new upper bound on the rate of non-binary codes
    Ben-Haim, Yael
    Litsyn, Simon
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 297 - 301
  • [37] Binary and ternary codes of covering radius one: some new lower bounds
    Haas, W
    DISCRETE MATHEMATICS, 2002, 256 (1-2) : 161 - 178
  • [38] Bounds on the Belief Propagation Threshold of Non-Binary LDPC Codes
    Geller, Leonid
    Burshtein, David
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (05) : 2639 - 2657
  • [39] Bounds on the Belief Propagation Threshold of Non-Binary LDPC Codes
    Geller, Leonid
    Burshtein, David
    2012 IEEE INFORMATION THEORY WORKSHOP (ITW), 2012, : 357 - 361
  • [40] ASYMPTOTIC UPPER BOUNDS ON THE MINIMUM DISTANCE OF TRELLIS CODES.
    Calderbank, A.Robert
    Mazo, J.E.
    Wei, Victor K.
    IEEE Transactions on Communications, 1985, COM-33 (04): : 305 - 309