Plotkin bound generalization to the case of multiple packings

被引：0
|
作者：
V. M. Blinovsky
机构：
[1] RAS,Kharkevich Institute for Information Transmission Problems
来源：
Problems of Information Transmission | 2009年 / 45卷
关键词：
Information Transmission; Random Matrice; Average Radius; Code Vector; Finite Alphabet;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We obtain an upper bound on the cardinality of a multiple packing in the case of a large decoding radius.
引用
收藏
页码：1 / 4
页数：3
相关论文
共 50 条
  • [1] Plotkin bound generalization to the case of multiple packings
    Blinovsky, V. M.
    PROBLEMS OF INFORMATION TRANSMISSION, 2009, 45 (01) : 1 - 4
  • [2] Generalization of Plotkin bound to the case of multiple packing
    Blinovsky, Vladimir
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 2048 - 2050
  • [3] Some remarks on the Plotkin bound
    Quistorff, J
    ELECTRONIC JOURNAL OF COMBINATORICS, 2003, 10 (01):
  • [4] A remark on Plotkin's bound
    de Laúney, W
    Gordon, DM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (01) : 352 - 355
  • [5] Modified Plotkin bound for unequal error protection codes
    Xie, L
    Chen, HF
    Egami, S
    Qiu, PL
    ELECTRONICS LETTERS, 2002, 38 (18) : 1041 - 1042
  • [6] A dual plotkin bound for (T, M, S)-nets
    Martin, William J.
    Visentin, Terry I.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (01) : 411 - 415
  • [7] MAXIMAL Q-ARY CODES AND PLOTKIN BOUND
    MACKENZIE, C
    SEBERRY, J
    ARS COMBINATORIA, 1988, 26B : 37 - 50
  • [8] THE WEIGHT BOUND AND SUBGEOMETRIC PACKINGS
    STANTON, RG
    ARS COMBINATORIA, 1992, 33 : 343 - 349
  • [9] Linear Plotkin bound for entanglement-assisted quantum codes
    Guo, Luobin
    Li, Ruihu
    PHYSICAL REVIEW A, 2013, 87 (03):
  • [10] A polytopal generalization of Apollonian packings and Descartes' theorem
    Alfonsin, Jorge L. Ramirez
    Rasskin, Ivan
    JOURNAL OF NUMBER THEORY, 2025, 275 : 67 - 103
12345