ON THE COVERING RADIUS OF SOME MODULAR CODES

被引：9

作者：

Gupta, Manish K. ^{[1
]}

Durairajan, Chinnappillai ^{[2
]}

机构：

[1] Dhirubhai Ambani Inst Informat & Commun Technol, Lab Nat Informat Proc, Gandhinagar 382007, Gujarat, India

[2] Bharathidasan Univ, Dept Math, Sch Math Sci, Tiruchirappalli 620024, Tamil Nadu, India

来源：

ADVANCES IN MATHEMATICS OF COMMUNICATIONS | 2014年 / 8卷 / 02期

关键词：

Covering radius; codes over rings; simplex codes; Hamming codes; SELF-DUAL CODES; II CODES;

D O I：

10.3934/amc.2014.8.129

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper gives lower and upper bounds on the covering radius of codes over Z(2s) with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type alpha and Type beta) and their dual and give bounds on the covering radii for MacDonald codes of both types over Z(4).

引用

页码：129 / 137

页数：9

共 50 条

[31] On the packing radius and the covering radius of equal-weight codes
Cohen, SD
Kuzjurin, NN
DISCRETE MATHEMATICS, 2000, 213 (1-3) : 35 - 42
[32] Covering radius of self-complementary codes and BCH codes
Laihonen, T
1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 434 - 434
[33] THE COVERING RADIUS OF HADAMARD CODES IN ODD GRAPHS
SOLE, P
GHAFOOR, A
SHEIKH, SA
DISCRETE APPLIED MATHEMATICS, 1992, 37-8 : 501 - 510
[34] ON THE COVERING RADIUS OF LONG BINARY BCH CODES
TIETAVAINEN, A
DISCRETE APPLIED MATHEMATICS, 1987, 16 (01) : 75 - 77
[35] A random construction for permutation codes and the covering radius
Peter Keevash
Cheng Yeaw Ku
Designs, Codes and Cryptography, 2006, 41 : 79 - 86
[36] IMPROVED SPHERE BOUNDS ON THE COVERING RADIUS OF CODES
VANWEE, GJM
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (02) : 237 - 245
[37] ON THE COVERING RADIUS OF REED-SOLOMON CODES
DUR, A
DISCRETE MATHEMATICS, 1994, 126 (1-3) : 99 - 105
[38] BOUNDS ON COVERING RADIUS OF DUAL PRODUCT CODES
KATSMAN, GL
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 573 : 52 - 57
[39] The complexity of the covering radius problem on lattices and codes
Guruswami, V
Micciancio, D
Regev, O
19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 161 - 173
[40] A random construction for permutation codes and the covering radius
Keevash, Peter
Ku, Cheng Yeaw
DESIGNS CODES AND CRYPTOGRAPHY, 2006, 41 (01) : 79 - 86

← 1 2 3 4 5 →