Article ID Journal Published Year Pages File Type
6874125 Information Processing Letters 2018 5 Pages PDF
Abstract
In this paper, we give some lower and upper bounds on the covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring F2+vF2, where v2=v. We determine the bounds on covering radius of repetition codes, simplex codes and MacDonald codes over this ring.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring F2+vF2
Authors
, , ,