ON THE COVERING RADIUS OF SOME MODULAR CODES

被引：10

作者：

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

共 22 条

[11]

Constantinescu I., 1996, P 5 INT WORKSH ALG C, P98

[12] SELF-DUAL CODES OVER THE INTEGERS MODULO-4 [J].