Refinement of the Sphere-Packing Bound

被引:0
|
作者
Altug, Yuecel [1 ]
Wagner, Aaron B. [1 ]
机构
[1] Cornell Univ, Sch Elect & Comp Engn, Ithaca, NY 14853 USA
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We provide a refinement of the sphere-packing bound for constant composition codes over discrete memoryless channels that improves the pre-factor in front of the exponential term. The order of our pre-factor is O(N-1/2(1 + rho R*)), where rho(R)* is related to the slope of the sphere-packing exponent and N is the blocklength.
引用
收藏
页数:5
相关论文
共 50 条
  • [1] Refinement of the Sphere-Packing Bound: Asymmetric Channels
    Altug, Yuecel
    Wagner, Aaron B.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (03) : 1592 - 1614
  • [2] Sphere-Packing Bound for Classical-Quantum Channels
    Cheng, Hao-Chung
    Hsieh, Min-Hsiu
    Tomamichel, Marco
    2017 IEEE INFORMATION THEORY WORKSHOP (ITW), 2017, : 479 - 483
  • [3] Sphere-Packing Bound for Symmetric Classical-Quantum Channels
    Cheng, Hao-Chung
    Hsieh, Min-Hsiu
    Tomamichel, Marco
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 286 - 290
  • [4] Generalized Sphere-Packing Bound for Subblock-Constrained Codes
    Kiah, Han Mao
    Tandon, Anshoo
    Motani, Mehul
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1737 - 1741
  • [6] Generalized Sphere-Packing Bound for Subblock-Constrained Codes
    Kiah, Han Mao
    Tandon, Anshoo
    Motani, Mehul
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (01) : 187 - 199
  • [7] SPHERE-PACKING IN HAMMING METRIC
    MCELIECE, RJ
    RUMSEY, H
    BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1969, 75 (01) : 32 - &
  • [8] A sphere-packing exponent approximation
    Babich, Fulvio
    2013 IEEE 77TH VEHICULAR TECHNOLOGY CONFERENCE (VTC SPRING), 2013,
  • [9] INEQUALITIES AND SPHERE-PACKING IN LP
    BALL, K
    ISRAEL JOURNAL OF MATHEMATICS, 1987, 58 (02) : 243 - 256
  • [10] Sphere-packing Bound for Block-codes with Feedback and Finite Memory
    Como, Giacomo
    Nakiboglu, Baris
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 251 - 255