Generalization of Plotkin bound to the case of multiple packing

被引:1
|
作者
Blinovsky, Vladimir [1 ]
机构
[1] RAS, Inst Informat Transmiss Problems, Moscow 117901, Russia
关键词
D O I
10.1109/ISIT.2009.5205458
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We derive an upper bound for the cardinality of multiple packing in the case of large decoding radius
引用
收藏
页码:2048 / 2050
页数:3
相关论文
共 50 条
  • [21] Generalization of the bound state model
    Harada, M
    Sannino, F
    Schechter, J
    Weigel, H
    PHYSICAL REVIEW D, 1997, 56 (07) : 4098 - 4114
  • [22] Generalization of the bound state model
    Harada, M.
    Sannino, F.
    Schechter, J.
    Weigel, H.
    Physical Review D Particles, Fields, Gravitation and Cosmology, 56 (07):
  • [23] Three-Dimensional Multiple-Bin-Size Bin Packing: A Case Study with a New MILP-Based Upper Bound
    Baazaoui, Mariem
    Hanafi, Said
    Kamoun, Hichem
    OPERATIONAL RESEARCH IN BUSINESS AND ECONOMICS, 2017, : 225 - 234
  • [24] LOCALIZED FUNCTIONS AS GENERALIZATION OF WANNIER FUNCTIONS IN CASE OF MULTIPLE BANDS
    KOGEL, G
    PHYSICA STATUS SOLIDI B-BASIC RESEARCH, 1971, 44 (02): : 577 - &
  • [25] A LOWER BOUND FOR ONLINE BIN PACKING
    LIANG, FM
    INFORMATION PROCESSING LETTERS, 1980, 10 (02) : 76 - 79
  • [26] A lower bound for online rectangle packing
    Leah Epstein
    Journal of Combinatorial Optimization, 2019, 38 : 846 - 866
  • [27] Refinement of the Sphere-Packing Bound
    Altug, Yuecel
    Wagner, Aaron B.
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [28] The Sphere Packing Bound for Memoryless Channels
    B. Nakiboğlu
    Problems of Information Transmission, 2020, 56 : 201 - 244
  • [29] Sphere Packing Bound for Quantum Channels
    Dalai, Marco
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012, : 160 - 164
  • [30] A New Sphere-Packing Bound for Maximal Error Exponent for Multiple-Access Channels
    Nazari, Ali
    Pradhan, S. Sandeep
    Anastasopoulos, Achilleas
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 1513 - 1517