COVERING RADIUS - IMPROVING ON THE SPHERE-COVERING BOUND

被引：0

|

作者：

SIMONIS, J

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 357卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

下载

收藏

页码：377 / 385

页数：9

相关论文

共 50 条

[31] On the Covering Radius of MDS Codes
Bartoli, Daniele
Giulietti, Massimo
Platoni, Irene
IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (02) : 801 - 811
[32] The complexity of the covering radius problem
Guruswami, V
Micciancio, D
Regev, O
COMPUTATIONAL COMPLEXITY, 2005, 14 (02) : 90 - 121
[33] ON THE COVERING RADIUS OF SUBCODES OF A CODE
HOU, XD
IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (06) : 1706 - 1707
[34] COVERING RADIUS AND WRITING ON MEMORIES
COHEN, GD
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 508 : 1 - 10
[35] COVERING RADIUS OF THE CIRCUIT CODE
SOLE, P
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 388 : 328 - 328
[36] Bounds on the covering radius of a lattice
Deza, M
Grishukhin, V
MATHEMATIKA, 1996, 43 (85) : 159 - 164
[37] Covering radius for sets of permutations
Cameron, PJ
Wanless, IM
DISCRETE MATHEMATICS, 2005, 293 (1-3) : 91 - 109
[38] On the covering radius of small codes
Kéri, G
Östergård, PRJ
STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2003, 40 (1-2) : 243 - 256
[39] Covering radius: Applications and generalizations
Cohen, G
Encheva, S
1998 INFORMATION THEORY WORKSHOP - KILLARNEY, IRELAND, 1998, : 52 - 52
[40] On covering radius and dual distance
Laihonen, T
1998 INFORMATION THEORY WORKSHOP - KILLARNEY, IRELAND, 1998, : 53 - 54

← 1 2 3 4 5 →