Codes from incidence matrices of some regular graphs

We examine the [Formula: see text]-ary linear codes with respect to Lee metric from incidence matrix of the Lee graph with vertex set [Formula: see text] and two vertices being adjacent if their Lee distance is one. All the main parameters of the codes are obtained as [Formula: see text] if [Formula: see text] is odd and [Formula: see text] if [Formula: see text] is even. We examine also the [Formula: see text]-ary linear codes with respect to Hamming metric from incidence matrices of Desargues graph, Pappus graph, Folkman graph and the main parameters of the codes are [Formula: see text], 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.

On the Covering Radius of Codes over Z p k

In this correspondence, we investigate the covering radius of various types of repetition codes over Z p k ( k ≥ 2 ) 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 Z p k . We also derive the lower and upper bounds on the covering radius of block repetition codes over Z p k .

On codes over ℤp2 and its covering radius

This paper gives lower and upper bounds on the covering radius of codes over [Formula: see text] with respect to Lee distance. We also determine the covering radius of various repetition codes over [Formula: see text]

On covering radius of codes over ℤ2p

In this paper, we gives lower and upper bounds on the covering radius of codes over [Formula: see text], where [Formula: see text] is a prime integer with respect to Lee distance. We also determine the covering radius of various Repetition codes over [Formula: see text], where [Formula: see text] is a prime integer.