Bounds on Covering Radius of F2R-Linear Codes
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Communications Letters"
DOI: 10.1109/lcomm.2020.3024543
Abstract: In this letter, we determine the bounds on covering radius of repetition codes, simplex codes and MacDonald codes over $\mathbb {F}_{2}R$ with respect to the Chinese Euclidean distance. read more here.
Keywords: linear codes; bounds covering; radius f2r; covering radius ... See more keywords