Generalization of Plotkin bound to the case of multiple packing

被引：1

|

作者：

Blinovsky, Vladimir ^{[1
]}

机构：

[1] RAS, Inst Informat Transmiss Problems, Moscow 117901, Russia

来源：

2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4 | 2009年

关键词：

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 条

[1] Plotkin bound generalization to the case of multiple packings
V. M. Blinovsky
Problems of Information Transmission, 2009, 45 : 1 - 4
[2] Plotkin bound generalization to the case of multiple packings
Blinovsky, V. M.
PROBLEMS OF INFORMATION TRANSMISSION, 2009, 45 (01) : 1 - 4
[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] Multiple container packing: A case study of pipe packing
George, JA
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1996, 47 (09) : 1098 - 1109
[6] Modified Plotkin bound for unequal error protection codes
Xie, L
Chen, HF
Egami, S
Qiu, PL
ELECTRONICS LETTERS, 2002, 38 (18) : 1041 - 1042
[7] 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
[8] MAXIMAL Q-ARY CODES AND PLOTKIN BOUND
MACKENZIE, C
SEBERRY, J
ARS COMBINATORIA, 1988, 26B : 37 - 50
[9] Lower bound for the linear multiple packing of the binary hamming space
Blinovsky, V
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2000, 92 (01) : 95 - 101
[10] Linear Plotkin bound for entanglement-assisted quantum codes
Guo, Luobin
Li, Ruihu
PHYSICAL REVIEW A, 2013, 87 (03):

← 1 2 3 4 5 →