On the covering radius of some modular codes

From MaRDI portal




Abstract: This paper gives lower and upper bounds on the covering radius of codes over with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type alpha and Type ) and their dual and give bounds on the covering radii for MacDonald codes of both types over .









This page was built for publication: On the covering radius of some modular codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476335)