On upper bounds for minimum distance and covering radius of non-binary codes

被引：0

|

作者：

Laihonen, Tero

Litsyn, Simon

机构：

来源：

Designs, Codes, and Cryptography | 1998年 / 14卷 / 01期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：71 / 80

相关论文

共 50 条

[41] Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes
Hashemi, Yoones
Banihashemi, Amir H.
IEEE COMMUNICATIONS LETTERS, 2018, 22 (01) : 33 - 36
[42] Generalized upper bounds on the minimum distance of PSK block codes
Laksman, Efraim
Lennerstad, Hakan
Nilsson, Magnus
IMA JOURNAL OF MATHEMATICAL CONTROL AND INFORMATION, 2015, 32 (02) : 305 - 327
[43] Upper bounds on the rate of LDPC codes as a function of minimum distance
Ben-Haim, Y
Litsyn, S
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) : 2092 - 2100
[44] ASYMPTOTIC UPPER-BOUNDS ON THE MINIMUM DISTANCE OF TRELLIS CODES
CALDERBANK, AR
MAZO, JE
WEI, VK
IEEE TRANSACTIONS ON COMMUNICATIONS, 1985, 33 (04) : 305 - 309
[45] Upper bounds on the rate of LDPC codes as a function of minimum distance
Ben-Haim, Y
Litsyn, S
2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 47 - 51
[46] ON THE COVERING RADIUS PROBLEM FOR CODES .1. BOUNDS ON NORMALIZED COVERING RADIUS
KILBY, KE
SLOANE, NJA
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1987, 8 (04): : 604 - 618
[47] IMPROVED SPHERE BOUNDS ON THE COVERING RADIUS OF CODES
VANWEE, GJM
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (02) : 237 - 245
[48] BOUNDS ON COVERING RADIUS OF DUAL PRODUCT CODES
KATSMAN, GL
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 573 : 52 - 57
[49] LOWER BOUNDS FOR BINARY COVERING CODES
HONKALA, IS
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (02) : 326 - 329
[50] UPPER BOUNDS ON CARDINALITY OF A BINARY CODE WITH A GIVEN MINIMUM DISTANCE
SIDELNIKOV, VM
INFORMATION AND CONTROL, 1975, 28 (04): : 292 - 303

← 1 2 3 4 5 →