Results
Title

On covering radius of codes over where using chinese euclidean distance.

Authors

Pandian, P. Chella

Abstract

In this paper, we give lower and upper bounds on the covering radius of codes over the ring where with respect to Chinese Euclidean distance and also obtain the covering radius of various Repetition codes, Simplex codes of -Type code and -Type code. We give bounds on the covering radius for MacDonald codes of both types over

Subjects

MATHEMATICAL bounds; EUCLIDEAN distance; FINITE rings; SIMPLEX algorithm; MATHEMATICAL analysis

Publication

Discrete Mathematics, Algorithms & Applications, 2017, Vol 9, Issue 2, p-1

ISSN

1793-8309

Publication type

Academic Journal

DOI

10.1142/S1793830917500173