Bounds on Covering Radius of F2R-Linear Codes | IEEE Journals & Magazine | IEEE Xplore

Bounds on Covering Radius of F2R-Linear Codes


Abstract:

In this letter, we determine the bounds on covering radius of repetition codes, simplex codes and MacDonald codes over F2R with respect to the Chinese Euclidean distance.

Abstract:

In this letter, we determine the bounds on covering radius of repetition codes, simplex codes and MacDonald codes over F2R with respect to the Chinese Euclidean distance.
Published in: IEEE Communications Letters ( Volume: 25, Issue: 1, January 2021)
Page(s): 23 - 27
Date of Publication: 21 September 2020

ISSN Information:

Funding Agency:


References

References is not available for this document.