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).
机构:
Univ Puerto Rico, Fac Business Adm, Stat Inst & Computerised Informat Syst, Rio Piedras Campus,15 Ave Univ Suite 1501, San Juan, PR 00925 USAUniv Puerto Rico, Fac Business Adm, Stat Inst & Computerised Informat Syst, Rio Piedras Campus,15 Ave Univ Suite 1501, San Juan, PR 00925 USA
Orozco, Juan Carlos
Janwa, Heeralal
论文数: 0引用数: 0
h-index: 0
机构:
Univ Puerto Rico Rio Piedras, Coll Nat Sci, Dept Math, 17 Univ Ave Ste 1701, San Juan, PR 00925 USAUniv Puerto Rico, Fac Business Adm, Stat Inst & Computerised Informat Syst, Rio Piedras Campus,15 Ave Univ Suite 1501, San Juan, PR 00925 USA
Janwa, Heeralal
COMBINATORICS, GRAPH THEORY AND COMPUTING, SEICCGTC 2021,
2024,
448
: 413
-
425