This paper gives lower and upper bounds on the covering radius of codes over $\mathbb{Z}_{2^s}$ 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 $\mathbb{Z}_4$.
1 September 1996 in IEEE Transactions on Information Theory
In this paper, we examine the binary linear codes with respect to Hamming metric from incidence matrix of a unit graph G(Z(n)) with vertex set is Z(n) and two distinct vertices x and y being adjacent if and only if x + y is unit. The main parameters of the codes are given.
5 March 2020 in Journal of Discrete Mathematical Sciences and Cryptography
We examine the p-ary linear codes from incidence matrix of the (n, k)-arrangement graphs for k = 2, n –2, n – 1. All the main parameters of the codes are obtained as respectively. We examine also the p-ary linear codes from incidence matrix of graphs such as Ljubljana graph, Heawood graph and the main parameters of the codes are [168, 111, 3]p, [21, 13, 3]p respectively. Any transitive subgroup of automorphism groups of these graphs can be used for full permutation decoding using the corresponding codes. All the above codes can be used for full error correction by permutation decoding.
In this correspondence, we investigate the covering radius of various types of repetition codes over with respect to the Lee distance. We determine the exact covering radius of the various repetition codes, which have been constructed using the zero divisors and units in . We also derive the lower and upper bounds on the covering radius of block repetition codes over .